./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-races/race-2_3-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a 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_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_3-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc --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 32bit --witnessprinter.graph.data.programhash a7e4b13d10edb91f551b46ac7114aaff2ae2d5e1278c432e05cda4c2eb58cb60 --- 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-5e519f3 [2022-11-02 20:18:04,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:18:04,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:18:04,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:18:04,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:18:04,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:18:04,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:18:04,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:18:04,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:18:04,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:18:04,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:18:04,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:18:04,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:18:04,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:18:04,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:18:04,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:18:04,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:18:04,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:18:04,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:18:04,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:18:04,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:18:04,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:18:04,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:18:04,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:18:04,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:18:04,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:18:04,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:18:04,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:18:04,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:18:04,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:18:04,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:18:04,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:18:04,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:18:04,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:18:04,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:18:04,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:18:04,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:18:04,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:18:04,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:18:04,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:18:04,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:18:04,173 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:18:04,214 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:18:04,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:18:04,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:18:04,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:18:04,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:18:04,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:18:04,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:18:04,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:18:04,218 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:18:04,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:18:04,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:18:04,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:18:04,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:18:04,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:18:04,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:18:04,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:18:04,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:18:04,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:18:04,221 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:18:04,221 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:18:04,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:18:04,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:18:04,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:18:04,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:18:04,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:18:04,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:18:04,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:04,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:18:04,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:18:04,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:18:04,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:18:04,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:18:04,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:18:04,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/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_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7e4b13d10edb91f551b46ac7114aaff2ae2d5e1278c432e05cda4c2eb58cb60 [2022-11-02 20:18:04,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:18:04,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:18:04,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:18:04,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:18:04,587 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:18:04,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2022-11-02 20:18:04,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/data/006f5e6f4/eb3b387a76324540a0a53593105490fb/FLAG6c6a7040c [2022-11-02 20:18:05,332 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:18:05,333 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2022-11-02 20:18:05,354 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/data/006f5e6f4/eb3b387a76324540a0a53593105490fb/FLAG6c6a7040c [2022-11-02 20:18:05,556 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/data/006f5e6f4/eb3b387a76324540a0a53593105490fb [2022-11-02 20:18:05,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:18:05,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:18:05,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:05,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:18:05,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:18:05,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:05" (1/1) ... [2022-11-02 20:18:05,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d88414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:05, skipping insertion in model container [2022-11-02 20:18:05,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:18:05" (1/1) ... [2022-11-02 20:18:05,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:18:05,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:18:05,848 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 20:18:06,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/sv-benchmarks/c/ldv-races/race-2_3-container_of.i[75002,75015] [2022-11-02 20:18:06,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:06,573 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:18:06,589 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 20:18:06,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/sv-benchmarks/c/ldv-races/race-2_3-container_of.i[75002,75015] [2022-11-02 20:18:06,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:18:06,816 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:18:06,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06 WrapperNode [2022-11-02 20:18:06,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:18:06,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:06,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:18:06,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:18:06,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,919 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2022-11-02 20:18:06,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:18:06,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:18:06,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:18:06,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:18:06,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:06,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:07,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:18:07,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:18:07,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:18:07,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:18:07,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (1/1) ... [2022-11-02 20:18:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:18:07,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:07,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:18:07,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1385cf7-6a67-4d10-b0d3-25dfea7dd7e8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:18:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:18:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:18:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:18:07,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:18:07,074 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:18:07,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:18:07,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:18:07,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:18:07,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:18:07,075 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-11-02 20:18:07,075 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-11-02 20:18:07,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:18:07,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:18:07,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:18:07,077 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:18:07,428 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:18:07,431 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:18:07,784 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:18:07,836 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:18:07,837 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:18:07,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:07 BoogieIcfgContainer [2022-11-02 20:18:07,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:18:07,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:18:07,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:18:07,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:18:07,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:18:05" (1/3) ... [2022-11-02 20:18:07,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b64c4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:07, skipping insertion in model container [2022-11-02 20:18:07,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:18:06" (2/3) ... [2022-11-02 20:18:07,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b64c4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:18:07, skipping insertion in model container [2022-11-02 20:18:07,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:18:07" (3/3) ... [2022-11-02 20:18:07,849 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2022-11-02 20:18:07,858 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:18:07,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:18:07,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:18:07,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:18:07,943 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:18:07,995 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:18:08,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 173 transitions, 362 flow [2022-11-02 20:18:08,017 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 173 transitions, 362 flow [2022-11-02 20:18:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 173 transitions, 362 flow [2022-11-02 20:18:08,148 INFO L130 PetriNetUnfolder]: 8/216 cut-off events. [2022-11-02 20:18:08,149 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:18:08,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 216 events. 8/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 350 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2022-11-02 20:18:08,159 INFO L118 LiptonReduction]: Number of co-enabled transitions 3900 [2022-11-02 20:19:36,351 INFO L133 LiptonReduction]: Checked pairs total: 9957 [2022-11-02 20:19:36,351 INFO L135 LiptonReduction]: Total number of compositions: 178 [2022-11-02 20:19:36,360 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 37 transitions, 90 flow [2022-11-02 20:19:36,427 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 636 states, 616 states have (on average 2.767857142857143) internal successors, (1705), 635 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:36,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:19:36,451 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@26e0da81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:19:36,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-02 20:19:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 636 states, 616 states have (on average 2.767857142857143) internal successors, (1705), 635 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:19:36,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:36,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:19:36,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash 622474212, now seen corresponding path program 1 times [2022-11-02 20:19:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:36,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651335107] [2022-11-02 20:19:36,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651335107] [2022-11-02 20:19:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651335107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:37,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:37,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:19:37,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202080307] [2022-11-02 20:19:37,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:37,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:19:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:19:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:19:37,753 INFO L87 Difference]: Start difference. First operand has 636 states, 616 states have (on average 2.767857142857143) internal successors, (1705), 635 states have internal predecessors, (1705), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:38,009 INFO L93 Difference]: Finished difference Result 634 states and 1641 transitions. [2022-11-02 20:19:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:19:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:38,031 INFO L225 Difference]: With dead ends: 634 [2022-11-02 20:19:38,032 INFO L226 Difference]: Without dead ends: 581 [2022-11-02 20:19:38,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:38,036 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:38,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-11-02 20:19:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2022-11-02 20:19:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 565 states have (on average 2.6371681415929205) internal successors, (1490), 580 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1490 transitions. [2022-11-02 20:19:38,121 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1490 transitions. Word has length 5 [2022-11-02 20:19:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:38,121 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1490 transitions. [2022-11-02 20:19:38,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1490 transitions. [2022-11-02 20:19:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:19:38,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:38,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:19:38,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:19:38,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2116892529, now seen corresponding path program 1 times [2022-11-02 20:19:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:38,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253737290] [2022-11-02 20:19:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:38,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:38,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253737290] [2022-11-02 20:19:38,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253737290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:38,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:38,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15720917] [2022-11-02 20:19:38,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:38,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:38,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:38,791 INFO L87 Difference]: Start difference. First operand 581 states and 1490 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-11-02 20:19:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:39,037 INFO L93 Difference]: Finished difference Result 575 states and 1474 transitions. [2022-11-02 20:19:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-11-02 20:19:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:39,042 INFO L225 Difference]: With dead ends: 575 [2022-11-02 20:19:39,042 INFO L226 Difference]: Without dead ends: 575 [2022-11-02 20:19:39,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:19:39,044 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:39,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-11-02 20:19:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2022-11-02 20:19:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 559 states have (on average 2.636851520572451) internal successors, (1474), 574 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1474 transitions. [2022-11-02 20:19:39,092 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1474 transitions. Word has length 6 [2022-11-02 20:19:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:39,093 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1474 transitions. [2022-11-02 20:19:39,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-11-02 20:19:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1474 transitions. [2022-11-02 20:19:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:19:39,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:39,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:39,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:19:39,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1174316467, now seen corresponding path program 1 times [2022-11-02 20:19:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:39,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410656022] [2022-11-02 20:19:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:39,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:39,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410656022] [2022-11-02 20:19:39,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410656022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:39,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:39,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757607122] [2022-11-02 20:19:39,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:39,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:39,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:39,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:39,778 INFO L87 Difference]: Start difference. First operand 575 states and 1474 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:40,054 INFO L93 Difference]: Finished difference Result 571 states and 1462 transitions. [2022-11-02 20:19:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:40,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 20:19:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:40,058 INFO L225 Difference]: With dead ends: 571 [2022-11-02 20:19:40,058 INFO L226 Difference]: Without dead ends: 571 [2022-11-02 20:19:40,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:19:40,060 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:40,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-02 20:19:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2022-11-02 20:19:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 555 states have (on average 2.6342342342342344) internal successors, (1462), 570 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1462 transitions. [2022-11-02 20:19:40,083 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1462 transitions. Word has length 7 [2022-11-02 20:19:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:40,083 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 1462 transitions. [2022-11-02 20:19:40,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1462 transitions. [2022-11-02 20:19:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:19:40,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:40,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:40,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:19:40,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:40,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1482500131, now seen corresponding path program 1 times [2022-11-02 20:19:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:40,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861221806] [2022-11-02 20:19:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:40,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861221806] [2022-11-02 20:19:40,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861221806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:40,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:40,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401940846] [2022-11-02 20:19:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:40,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:40,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:40,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:40,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:40,699 INFO L87 Difference]: Start difference. First operand 571 states and 1462 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:40,919 INFO L93 Difference]: Finished difference Result 567 states and 1450 transitions. [2022-11-02 20:19:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:19:40,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:40,923 INFO L225 Difference]: With dead ends: 567 [2022-11-02 20:19:40,923 INFO L226 Difference]: Without dead ends: 567 [2022-11-02 20:19:40,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:40,927 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:40,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-02 20:19:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2022-11-02 20:19:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 551 states have (on average 2.6315789473684212) internal successors, (1450), 566 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1450 transitions. [2022-11-02 20:19:40,947 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1450 transitions. Word has length 8 [2022-11-02 20:19:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:40,948 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 1450 transitions. [2022-11-02 20:19:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1450 transitions. [2022-11-02 20:19:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:19:40,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:40,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:40,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:19:40,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2043637095, now seen corresponding path program 1 times [2022-11-02 20:19:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:40,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616404566] [2022-11-02 20:19:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:41,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616404566] [2022-11-02 20:19:41,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616404566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:41,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:41,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115354069] [2022-11-02 20:19:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:41,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:41,498 INFO L87 Difference]: Start difference. First operand 567 states and 1450 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:41,738 INFO L93 Difference]: Finished difference Result 573 states and 1468 transitions. [2022-11-02 20:19:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:41,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:41,743 INFO L225 Difference]: With dead ends: 573 [2022-11-02 20:19:41,743 INFO L226 Difference]: Without dead ends: 573 [2022-11-02 20:19:41,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:41,744 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:41,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-11-02 20:19:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2022-11-02 20:19:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 555 states have (on average 2.6342342342342344) internal successors, (1462), 570 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1462 transitions. [2022-11-02 20:19:41,768 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1462 transitions. Word has length 8 [2022-11-02 20:19:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:41,769 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 1462 transitions. [2022-11-02 20:19:41,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:41,769 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1462 transitions. [2022-11-02 20:19:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:19:41,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:41,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:41,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:19:41,772 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2044074195, now seen corresponding path program 2 times [2022-11-02 20:19:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:41,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006473946] [2022-11-02 20:19:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:42,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006473946] [2022-11-02 20:19:42,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006473946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:42,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:42,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136549135] [2022-11-02 20:19:42,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:42,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:42,394 INFO L87 Difference]: Start difference. First operand 571 states and 1462 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:42,709 INFO L93 Difference]: Finished difference Result 567 states and 1450 transitions. [2022-11-02 20:19:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:19:42,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:42,713 INFO L225 Difference]: With dead ends: 567 [2022-11-02 20:19:42,713 INFO L226 Difference]: Without dead ends: 567 [2022-11-02 20:19:42,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:42,714 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:42,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-02 20:19:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2022-11-02 20:19:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 547 states have (on average 2.6288848263254114) internal successors, (1438), 562 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1438 transitions. [2022-11-02 20:19:42,737 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1438 transitions. Word has length 8 [2022-11-02 20:19:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:42,737 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 1438 transitions. [2022-11-02 20:19:42,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-11-02 20:19:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1438 transitions. [2022-11-02 20:19:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:42,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:42,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:42,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:19:42,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1287132360, now seen corresponding path program 1 times [2022-11-02 20:19:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:42,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929422827] [2022-11-02 20:19:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:43,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929422827] [2022-11-02 20:19:43,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929422827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:43,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:43,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652266709] [2022-11-02 20:19:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:43,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:43,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:43,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:43,023 INFO L87 Difference]: Start difference. First operand 563 states and 1438 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:43,281 INFO L93 Difference]: Finished difference Result 748 states and 1876 transitions. [2022-11-02 20:19:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:43,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:43,288 INFO L225 Difference]: With dead ends: 748 [2022-11-02 20:19:43,288 INFO L226 Difference]: Without dead ends: 744 [2022-11-02 20:19:43,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:43,289 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:43,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 6 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-02 20:19:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 623. [2022-11-02 20:19:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 607 states have (on average 2.639209225700165) internal successors, (1602), 622 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1602 transitions. [2022-11-02 20:19:43,316 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1602 transitions. Word has length 9 [2022-11-02 20:19:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:43,317 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 1602 transitions. [2022-11-02 20:19:43,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1602 transitions. [2022-11-02 20:19:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:43,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:43,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:43,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:19:43,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1285798802, now seen corresponding path program 1 times [2022-11-02 20:19:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:43,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315423375] [2022-11-02 20:19:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:44,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315423375] [2022-11-02 20:19:44,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315423375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:44,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:44,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:44,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345598928] [2022-11-02 20:19:44,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:44,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:44,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:44,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:44,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:44,256 INFO L87 Difference]: Start difference. First operand 623 states and 1602 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:44,931 INFO L93 Difference]: Finished difference Result 638 states and 1645 transitions. [2022-11-02 20:19:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:19:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:44,936 INFO L225 Difference]: With dead ends: 638 [2022-11-02 20:19:44,936 INFO L226 Difference]: Without dead ends: 638 [2022-11-02 20:19:44,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:19:44,938 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:44,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:19:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-11-02 20:19:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 632. [2022-11-02 20:19:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 616 states have (on average 2.642857142857143) internal successors, (1628), 631 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1628 transitions. [2022-11-02 20:19:44,963 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1628 transitions. Word has length 9 [2022-11-02 20:19:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:44,964 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1628 transitions. [2022-11-02 20:19:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1628 transitions. [2022-11-02 20:19:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:44,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:44,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:44,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:19:44,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1285798771, now seen corresponding path program 1 times [2022-11-02 20:19:44,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:44,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517961033] [2022-11-02 20:19:44,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:45,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517961033] [2022-11-02 20:19:45,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517961033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:45,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:45,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365491180] [2022-11-02 20:19:45,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:45,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:45,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:45,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:45,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:45,676 INFO L87 Difference]: Start difference. First operand 632 states and 1628 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:46,396 INFO L93 Difference]: Finished difference Result 642 states and 1656 transitions. [2022-11-02 20:19:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:19:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:46,400 INFO L225 Difference]: With dead ends: 642 [2022-11-02 20:19:46,400 INFO L226 Difference]: Without dead ends: 642 [2022-11-02 20:19:46,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:19:46,401 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:46,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:19:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-11-02 20:19:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 638. [2022-11-02 20:19:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 622 states have (on average 2.644694533762058) internal successors, (1645), 637 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1645 transitions. [2022-11-02 20:19:46,423 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1645 transitions. Word has length 9 [2022-11-02 20:19:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:46,424 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1645 transitions. [2022-11-02 20:19:46,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1645 transitions. [2022-11-02 20:19:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:46,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:46,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:46,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:19:46,425 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1287634622, now seen corresponding path program 2 times [2022-11-02 20:19:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:46,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222177643] [2022-11-02 20:19:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:47,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:47,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222177643] [2022-11-02 20:19:47,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222177643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:47,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654706352] [2022-11-02 20:19:47,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:47,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:47,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:47,178 INFO L87 Difference]: Start difference. First operand 638 states and 1645 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:47,620 INFO L93 Difference]: Finished difference Result 638 states and 1644 transitions. [2022-11-02 20:19:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:19:47,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:47,624 INFO L225 Difference]: With dead ends: 638 [2022-11-02 20:19:47,624 INFO L226 Difference]: Without dead ends: 638 [2022-11-02 20:19:47,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:19:47,625 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:47,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-11-02 20:19:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2022-11-02 20:19:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 618 states have (on average 2.6423948220064726) internal successors, (1633), 633 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1633 transitions. [2022-11-02 20:19:47,647 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1633 transitions. Word has length 9 [2022-11-02 20:19:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:47,648 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 1633 transitions. [2022-11-02 20:19:47,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1633 transitions. [2022-11-02 20:19:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:47,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:47,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:47,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:19:47,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1038500888, now seen corresponding path program 3 times [2022-11-02 20:19:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:47,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657543120] [2022-11-02 20:19:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:48,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:48,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657543120] [2022-11-02 20:19:48,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657543120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:48,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:48,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497292518] [2022-11-02 20:19:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:48,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:48,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:48,376 INFO L87 Difference]: Start difference. First operand 634 states and 1633 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:49,177 INFO L93 Difference]: Finished difference Result 643 states and 1658 transitions. [2022-11-02 20:19:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:19:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:49,182 INFO L225 Difference]: With dead ends: 643 [2022-11-02 20:19:49,182 INFO L226 Difference]: Without dead ends: 643 [2022-11-02 20:19:49,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:19:49,183 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:49,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:19:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-02 20:19:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 637. [2022-11-02 20:19:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 621 states have (on average 2.6441223832528182) internal successors, (1642), 636 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1642 transitions. [2022-11-02 20:19:49,207 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1642 transitions. Word has length 9 [2022-11-02 20:19:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:49,208 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1642 transitions. [2022-11-02 20:19:49,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1642 transitions. [2022-11-02 20:19:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:49,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:49,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:19:49,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1038500919, now seen corresponding path program 2 times [2022-11-02 20:19:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:49,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886455649] [2022-11-02 20:19:49,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:49,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886455649] [2022-11-02 20:19:49,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886455649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:49,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:49,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699878660] [2022-11-02 20:19:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:49,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:49,902 INFO L87 Difference]: Start difference. First operand 637 states and 1642 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:50,739 INFO L93 Difference]: Finished difference Result 659 states and 1702 transitions. [2022-11-02 20:19:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:19:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:50,745 INFO L225 Difference]: With dead ends: 659 [2022-11-02 20:19:50,745 INFO L226 Difference]: Without dead ends: 659 [2022-11-02 20:19:50,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:19:50,747 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:50,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:19:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-02 20:19:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 638. [2022-11-02 20:19:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 622 states have (on average 2.644694533762058) internal successors, (1645), 637 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1645 transitions. [2022-11-02 20:19:50,781 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1645 transitions. Word has length 9 [2022-11-02 20:19:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:50,781 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1645 transitions. [2022-11-02 20:19:50,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1645 transitions. [2022-11-02 20:19:50,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:50,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:50,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:50,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:19:50,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1036665068, now seen corresponding path program 4 times [2022-11-02 20:19:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:50,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096081573] [2022-11-02 20:19:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:51,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096081573] [2022-11-02 20:19:51,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096081573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:51,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:51,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269074394] [2022-11-02 20:19:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:51,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:51,626 INFO L87 Difference]: Start difference. First operand 638 states and 1645 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:52,451 INFO L93 Difference]: Finished difference Result 646 states and 1666 transitions. [2022-11-02 20:19:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:19:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:52,456 INFO L225 Difference]: With dead ends: 646 [2022-11-02 20:19:52,456 INFO L226 Difference]: Without dead ends: 646 [2022-11-02 20:19:52,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:19:52,457 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:52,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:19:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-11-02 20:19:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 631. [2022-11-02 20:19:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 615 states have (on average 2.640650406504065) internal successors, (1624), 630 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1624 transitions. [2022-11-02 20:19:52,482 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1624 transitions. Word has length 9 [2022-11-02 20:19:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:52,482 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 1624 transitions. [2022-11-02 20:19:52,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1624 transitions. [2022-11-02 20:19:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:52,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:52,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:52,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:19:52,484 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1078757860, now seen corresponding path program 2 times [2022-11-02 20:19:52,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:52,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215063892] [2022-11-02 20:19:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215063892] [2022-11-02 20:19:52,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215063892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:52,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:52,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851241479] [2022-11-02 20:19:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:52,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:52,794 INFO L87 Difference]: Start difference. First operand 631 states and 1624 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:53,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:53,182 INFO L93 Difference]: Finished difference Result 902 states and 2294 transitions. [2022-11-02 20:19:53,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:53,189 INFO L225 Difference]: With dead ends: 902 [2022-11-02 20:19:53,189 INFO L226 Difference]: Without dead ends: 896 [2022-11-02 20:19:53,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:19:53,190 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 91 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:53,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 2 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-11-02 20:19:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 621. [2022-11-02 20:19:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 605 states have (on average 2.6297520661157026) internal successors, (1591), 620 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1591 transitions. [2022-11-02 20:19:53,218 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1591 transitions. Word has length 9 [2022-11-02 20:19:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:53,218 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 1591 transitions. [2022-11-02 20:19:53,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1591 transitions. [2022-11-02 20:19:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:53,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:53,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:53,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:19:53,220 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1078778320, now seen corresponding path program 1 times [2022-11-02 20:19:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:53,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402824859] [2022-11-02 20:19:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:53,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402824859] [2022-11-02 20:19:53,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402824859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:53,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:53,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:53,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840494602] [2022-11-02 20:19:53,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:53,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:53,608 INFO L87 Difference]: Start difference. First operand 621 states and 1591 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:54,035 INFO L93 Difference]: Finished difference Result 869 states and 2189 transitions. [2022-11-02 20:19:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:54,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:54,041 INFO L225 Difference]: With dead ends: 869 [2022-11-02 20:19:54,042 INFO L226 Difference]: Without dead ends: 869 [2022-11-02 20:19:54,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:19:54,046 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:54,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-11-02 20:19:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 702. [2022-11-02 20:19:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 686 states have (on average 2.6370262390670556) internal successors, (1809), 701 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1809 transitions. [2022-11-02 20:19:54,075 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1809 transitions. Word has length 9 [2022-11-02 20:19:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:54,075 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 1809 transitions. [2022-11-02 20:19:54,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1809 transitions. [2022-11-02 20:19:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:54,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:54,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:54,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:19:54,078 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1071764260, now seen corresponding path program 2 times [2022-11-02 20:19:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:54,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689219262] [2022-11-02 20:19:54,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:54,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689219262] [2022-11-02 20:19:54,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689219262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:54,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:54,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400349055] [2022-11-02 20:19:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:54,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:54,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:54,413 INFO L87 Difference]: Start difference. First operand 702 states and 1809 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:54,774 INFO L93 Difference]: Finished difference Result 842 states and 2082 transitions. [2022-11-02 20:19:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:19:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:54,780 INFO L225 Difference]: With dead ends: 842 [2022-11-02 20:19:54,780 INFO L226 Difference]: Without dead ends: 842 [2022-11-02 20:19:54,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:54,784 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 90 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:54,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 3 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-11-02 20:19:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 652. [2022-11-02 20:19:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 636 states have (on average 2.608490566037736) internal successors, (1659), 651 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1659 transitions. [2022-11-02 20:19:54,810 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1659 transitions. Word has length 9 [2022-11-02 20:19:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:54,812 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1659 transitions. [2022-11-02 20:19:54,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-11-02 20:19:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1659 transitions. [2022-11-02 20:19:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:54,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:54,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:54,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:19:54,814 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1053645938, now seen corresponding path program 5 times [2022-11-02 20:19:54,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:54,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387593952] [2022-11-02 20:19:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:55,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:55,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387593952] [2022-11-02 20:19:55,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387593952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:55,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:55,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160844807] [2022-11-02 20:19:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:55,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:55,804 INFO L87 Difference]: Start difference. First operand 652 states and 1659 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:56,474 INFO L93 Difference]: Finished difference Result 644 states and 1635 transitions. [2022-11-02 20:19:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:56,480 INFO L225 Difference]: With dead ends: 644 [2022-11-02 20:19:56,480 INFO L226 Difference]: Without dead ends: 644 [2022-11-02 20:19:56,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:19:56,482 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:56,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:19:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-02 20:19:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2022-11-02 20:19:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 626 states have (on average 2.6038338658146967) internal successors, (1630), 641 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1630 transitions. [2022-11-02 20:19:56,512 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1630 transitions. Word has length 9 [2022-11-02 20:19:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:56,512 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1630 transitions. [2022-11-02 20:19:56,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1630 transitions. [2022-11-02 20:19:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:19:56,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:56,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:56,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:19:56,515 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1053645969, now seen corresponding path program 3 times [2022-11-02 20:19:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573112338] [2022-11-02 20:19:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:57,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:57,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573112338] [2022-11-02 20:19:57,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573112338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:57,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:57,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:57,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601265800] [2022-11-02 20:19:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:57,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:19:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:57,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:19:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:19:57,219 INFO L87 Difference]: Start difference. First operand 642 states and 1630 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:58,342 INFO L93 Difference]: Finished difference Result 649 states and 1647 transitions. [2022-11-02 20:19:58,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:19:58,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:58,346 INFO L225 Difference]: With dead ends: 649 [2022-11-02 20:19:58,346 INFO L226 Difference]: Without dead ends: 649 [2022-11-02 20:19:58,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:19:58,347 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:58,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:19:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-11-02 20:19:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 632. [2022-11-02 20:19:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 616 states have (on average 2.5990259740259742) internal successors, (1601), 631 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1601 transitions. [2022-11-02 20:19:58,367 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1601 transitions. Word has length 9 [2022-11-02 20:19:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:58,367 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1601 transitions. [2022-11-02 20:19:58,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-11-02 20:19:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1601 transitions. [2022-11-02 20:19:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:19:58,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:58,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:58,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:19:58,370 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:19:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1246627494, now seen corresponding path program 1 times [2022-11-02 20:19:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:58,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140591015] [2022-11-02 20:19:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:59,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140591015] [2022-11-02 20:19:59,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140591015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:59,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:59,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:19:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855025392] [2022-11-02 20:19:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:59,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:19:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:19:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:19:59,268 INFO L87 Difference]: Start difference. First operand 632 states and 1601 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:00,219 INFO L93 Difference]: Finished difference Result 661 states and 1684 transitions. [2022-11-02 20:20:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:00,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:00,224 INFO L225 Difference]: With dead ends: 661 [2022-11-02 20:20:00,224 INFO L226 Difference]: Without dead ends: 661 [2022-11-02 20:20:00,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:00,225 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:00,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-11-02 20:20:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 644. [2022-11-02 20:20:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 628 states have (on average 2.605095541401274) internal successors, (1636), 643 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1636 transitions. [2022-11-02 20:20:00,258 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1636 transitions. Word has length 10 [2022-11-02 20:20:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:00,258 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1636 transitions. [2022-11-02 20:20:00,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1636 transitions. [2022-11-02 20:20:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:20:00,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:00,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:00,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:20:00,260 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1246627463, now seen corresponding path program 1 times [2022-11-02 20:20:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:00,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506504475] [2022-11-02 20:20:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:01,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506504475] [2022-11-02 20:20:01,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506504475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:01,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:01,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:01,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254428224] [2022-11-02 20:20:01,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:01,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:01,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:01,105 INFO L87 Difference]: Start difference. First operand 644 states and 1636 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:01,724 INFO L93 Difference]: Finished difference Result 662 states and 1686 transitions. [2022-11-02 20:20:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:20:01,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:01,729 INFO L225 Difference]: With dead ends: 662 [2022-11-02 20:20:01,729 INFO L226 Difference]: Without dead ends: 662 [2022-11-02 20:20:01,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:01,731 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:01,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-02 20:20:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 656. [2022-11-02 20:20:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 640 states have (on average 2.609375) internal successors, (1670), 655 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1670 transitions. [2022-11-02 20:20:01,752 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1670 transitions. Word has length 10 [2022-11-02 20:20:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:01,753 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1670 transitions. [2022-11-02 20:20:01,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1670 transitions. [2022-11-02 20:20:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:20:01,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:01,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:01,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:20:01,755 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1248463314, now seen corresponding path program 2 times [2022-11-02 20:20:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:01,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787765279] [2022-11-02 20:20:01,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787765279] [2022-11-02 20:20:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787765279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:02,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:02,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027868898] [2022-11-02 20:20:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:02,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:02,586 INFO L87 Difference]: Start difference. First operand 656 states and 1670 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:03,273 INFO L93 Difference]: Finished difference Result 667 states and 1700 transitions. [2022-11-02 20:20:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:03,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:03,279 INFO L225 Difference]: With dead ends: 667 [2022-11-02 20:20:03,279 INFO L226 Difference]: Without dead ends: 667 [2022-11-02 20:20:03,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:03,280 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:03,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-02 20:20:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 658. [2022-11-02 20:20:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 642 states have (on average 2.6105919003115265) internal successors, (1676), 657 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1676 transitions. [2022-11-02 20:20:03,318 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1676 transitions. Word has length 10 [2022-11-02 20:20:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:03,319 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1676 transitions. [2022-11-02 20:20:03,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1676 transitions. [2022-11-02 20:20:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:20:03,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:03,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:03,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:20:03,321 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1205059284, now seen corresponding path program 3 times [2022-11-02 20:20:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:03,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539351792] [2022-11-02 20:20:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:04,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539351792] [2022-11-02 20:20:04,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539351792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:04,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644980664] [2022-11-02 20:20:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:04,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:04,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:04,210 INFO L87 Difference]: Start difference. First operand 658 states and 1676 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:04,951 INFO L93 Difference]: Finished difference Result 648 states and 1646 transitions. [2022-11-02 20:20:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:04,957 INFO L225 Difference]: With dead ends: 648 [2022-11-02 20:20:04,957 INFO L226 Difference]: Without dead ends: 648 [2022-11-02 20:20:04,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:04,958 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:04,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-11-02 20:20:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2022-11-02 20:20:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 624 states have (on average 2.6009615384615383) internal successors, (1623), 639 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1623 transitions. [2022-11-02 20:20:04,987 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1623 transitions. Word has length 10 [2022-11-02 20:20:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:04,988 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 1623 transitions. [2022-11-02 20:20:04,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1623 transitions. [2022-11-02 20:20:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:20:04,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:04,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:04,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:20:04,991 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2087186191, now seen corresponding path program 2 times [2022-11-02 20:20:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:04,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224154449] [2022-11-02 20:20:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:05,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224154449] [2022-11-02 20:20:05,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224154449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:05,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:05,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095799608] [2022-11-02 20:20:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:05,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:05,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:05,819 INFO L87 Difference]: Start difference. First operand 640 states and 1623 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:06,616 INFO L93 Difference]: Finished difference Result 669 states and 1703 transitions. [2022-11-02 20:20:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:20:06,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:06,620 INFO L225 Difference]: With dead ends: 669 [2022-11-02 20:20:06,621 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:20:06,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:06,622 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:06,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:20:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 636. [2022-11-02 20:20:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 620 states have (on average 2.5983870967741933) internal successors, (1611), 635 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1611 transitions. [2022-11-02 20:20:06,643 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1611 transitions. Word has length 10 [2022-11-02 20:20:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:06,643 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 1611 transitions. [2022-11-02 20:20:06,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1611 transitions. [2022-11-02 20:20:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:20:06,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:06,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:06,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:20:06,647 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1139822115, now seen corresponding path program 3 times [2022-11-02 20:20:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:06,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263990692] [2022-11-02 20:20:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:07,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:07,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263990692] [2022-11-02 20:20:07,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263990692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:07,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:07,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:07,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489472128] [2022-11-02 20:20:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:07,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:07,369 INFO L87 Difference]: Start difference. First operand 636 states and 1611 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:08,401 INFO L93 Difference]: Finished difference Result 661 states and 1680 transitions. [2022-11-02 20:20:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:08,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:08,406 INFO L225 Difference]: With dead ends: 661 [2022-11-02 20:20:08,407 INFO L226 Difference]: Without dead ends: 661 [2022-11-02 20:20:08,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:20:08,408 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:08,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-11-02 20:20:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 636. [2022-11-02 20:20:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 620 states have (on average 2.5983870967741933) internal successors, (1611), 635 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1611 transitions. [2022-11-02 20:20:08,429 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1611 transitions. Word has length 10 [2022-11-02 20:20:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:08,430 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 1611 transitions. [2022-11-02 20:20:08,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1611 transitions. [2022-11-02 20:20:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:20:08,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:08,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:08,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:20:08,432 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1696760055, now seen corresponding path program 4 times [2022-11-02 20:20:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:08,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150335742] [2022-11-02 20:20:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:09,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150335742] [2022-11-02 20:20:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150335742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:09,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:09,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497172348] [2022-11-02 20:20:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:09,266 INFO L87 Difference]: Start difference. First operand 636 states and 1611 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:10,103 INFO L93 Difference]: Finished difference Result 632 states and 1599 transitions. [2022-11-02 20:20:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:20:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:10,108 INFO L225 Difference]: With dead ends: 632 [2022-11-02 20:20:10,108 INFO L226 Difference]: Without dead ends: 632 [2022-11-02 20:20:10,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:10,109 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:10,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-02 20:20:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2022-11-02 20:20:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 604 states have (on average 2.5910596026490067) internal successors, (1565), 619 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1565 transitions. [2022-11-02 20:20:10,130 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1565 transitions. Word has length 10 [2022-11-02 20:20:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:10,130 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1565 transitions. [2022-11-02 20:20:10,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1565 transitions. [2022-11-02 20:20:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:10,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:10,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:10,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:20:10,132 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash -16272206, now seen corresponding path program 1 times [2022-11-02 20:20:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:10,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117264210] [2022-11-02 20:20:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117264210] [2022-11-02 20:20:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117264210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:10,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084216984] [2022-11-02 20:20:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:10,664 INFO L87 Difference]: Start difference. First operand 620 states and 1565 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:11,431 INFO L93 Difference]: Finished difference Result 1450 states and 3562 transitions. [2022-11-02 20:20:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:11,446 INFO L225 Difference]: With dead ends: 1450 [2022-11-02 20:20:11,455 INFO L226 Difference]: Without dead ends: 1450 [2022-11-02 20:20:11,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:20:11,456 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 218 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:11,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 10 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-11-02 20:20:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 648. [2022-11-02 20:20:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 632 states have (on average 2.6091772151898733) internal successors, (1649), 647 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1649 transitions. [2022-11-02 20:20:11,512 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1649 transitions. Word has length 11 [2022-11-02 20:20:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:11,513 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 1649 transitions. [2022-11-02 20:20:11,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1649 transitions. [2022-11-02 20:20:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:11,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:11,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:11,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:20:11,516 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:11,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -9353006, now seen corresponding path program 2 times [2022-11-02 20:20:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:11,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848015608] [2022-11-02 20:20:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848015608] [2022-11-02 20:20:12,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848015608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:12,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:12,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529422374] [2022-11-02 20:20:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:12,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:12,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:12,030 INFO L87 Difference]: Start difference. First operand 648 states and 1649 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:13,024 INFO L93 Difference]: Finished difference Result 1285 states and 3143 transitions. [2022-11-02 20:20:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:20:13,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:13,031 INFO L225 Difference]: With dead ends: 1285 [2022-11-02 20:20:13,032 INFO L226 Difference]: Without dead ends: 1285 [2022-11-02 20:20:13,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:13,033 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 224 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:13,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 12 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2022-11-02 20:20:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 652. [2022-11-02 20:20:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 636 states have (on average 2.611635220125786) internal successors, (1661), 651 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1661 transitions. [2022-11-02 20:20:13,060 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1661 transitions. Word has length 11 [2022-11-02 20:20:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:13,060 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1661 transitions. [2022-11-02 20:20:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1661 transitions. [2022-11-02 20:20:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:13,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:13,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:13,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:20:13,062 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:13,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:13,063 INFO L85 PathProgramCache]: Analyzing trace with hash -171781195, now seen corresponding path program 1 times [2022-11-02 20:20:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:13,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191704601] [2022-11-02 20:20:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:13,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:13,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191704601] [2022-11-02 20:20:13,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191704601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:13,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:13,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415698190] [2022-11-02 20:20:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:13,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:13,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:13,668 INFO L87 Difference]: Start difference. First operand 652 states and 1661 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:14,595 INFO L93 Difference]: Finished difference Result 1244 states and 3070 transitions. [2022-11-02 20:20:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:14,602 INFO L225 Difference]: With dead ends: 1244 [2022-11-02 20:20:14,602 INFO L226 Difference]: Without dead ends: 1244 [2022-11-02 20:20:14,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:20:14,609 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 141 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:14,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 10 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2022-11-02 20:20:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 648. [2022-11-02 20:20:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 632 states have (on average 2.6091772151898733) internal successors, (1649), 647 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1649 transitions. [2022-11-02 20:20:14,639 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1649 transitions. Word has length 11 [2022-11-02 20:20:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:14,640 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 1649 transitions. [2022-11-02 20:20:14,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1649 transitions. [2022-11-02 20:20:14,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:14,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:14,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:14,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:20:14,643 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash -169945375, now seen corresponding path program 2 times [2022-11-02 20:20:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:14,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445407507] [2022-11-02 20:20:14,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:14,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445407507] [2022-11-02 20:20:15,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445407507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:15,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:15,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143217124] [2022-11-02 20:20:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:15,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:15,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:15,272 INFO L87 Difference]: Start difference. First operand 648 states and 1649 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:16,150 INFO L93 Difference]: Finished difference Result 1240 states and 3056 transitions. [2022-11-02 20:20:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:16,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:16,156 INFO L225 Difference]: With dead ends: 1240 [2022-11-02 20:20:16,156 INFO L226 Difference]: Without dead ends: 1240 [2022-11-02 20:20:16,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:20:16,157 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 200 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:16,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 10 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-11-02 20:20:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 656. [2022-11-02 20:20:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 640 states have (on average 2.6140625) internal successors, (1673), 655 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1673 transitions. [2022-11-02 20:20:16,183 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1673 transitions. Word has length 11 [2022-11-02 20:20:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:16,185 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1673 transitions. [2022-11-02 20:20:16,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1673 transitions. [2022-11-02 20:20:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:16,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:16,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:16,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:20:16,187 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 47490485, now seen corresponding path program 3 times [2022-11-02 20:20:16,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:16,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540892008] [2022-11-02 20:20:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540892008] [2022-11-02 20:20:16,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540892008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:16,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:16,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437180957] [2022-11-02 20:20:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:16,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:16,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:16,731 INFO L87 Difference]: Start difference. First operand 656 states and 1673 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:17,452 INFO L93 Difference]: Finished difference Result 1140 states and 2798 transitions. [2022-11-02 20:20:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:17,457 INFO L225 Difference]: With dead ends: 1140 [2022-11-02 20:20:17,458 INFO L226 Difference]: Without dead ends: 1140 [2022-11-02 20:20:17,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:17,459 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 185 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:17,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 12 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-11-02 20:20:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 650. [2022-11-02 20:20:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 634 states have (on average 2.610410094637224) internal successors, (1655), 649 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1655 transitions. [2022-11-02 20:20:17,486 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1655 transitions. Word has length 11 [2022-11-02 20:20:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:17,486 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1655 transitions. [2022-11-02 20:20:17,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1655 transitions. [2022-11-02 20:20:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:17,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:17,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:17,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:20:17,489 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1438554097, now seen corresponding path program 1 times [2022-11-02 20:20:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120292868] [2022-11-02 20:20:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:18,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:18,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120292868] [2022-11-02 20:20:18,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120292868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:18,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:18,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241755212] [2022-11-02 20:20:18,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:18,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:18,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:18,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:18,915 INFO L87 Difference]: Start difference. First operand 650 states and 1655 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:20,334 INFO L93 Difference]: Finished difference Result 994 states and 2384 transitions. [2022-11-02 20:20:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:20:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:20,339 INFO L225 Difference]: With dead ends: 994 [2022-11-02 20:20:20,339 INFO L226 Difference]: Without dead ends: 994 [2022-11-02 20:20:20,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:20:20,340 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 77 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:20,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 6 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:20:20,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-11-02 20:20:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 731. [2022-11-02 20:20:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 715 states have (on average 2.602797202797203) internal successors, (1861), 730 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1861 transitions. [2022-11-02 20:20:20,365 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1861 transitions. Word has length 11 [2022-11-02 20:20:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:20,366 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1861 transitions. [2022-11-02 20:20:20,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1861 transitions. [2022-11-02 20:20:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:20,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:20,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:20,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:20:20,368 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1438554096, now seen corresponding path program 1 times [2022-11-02 20:20:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:20,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627867700] [2022-11-02 20:20:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:21,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627867700] [2022-11-02 20:20:21,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627867700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:21,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:21,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961823948] [2022-11-02 20:20:21,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:21,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:21,434 INFO L87 Difference]: Start difference. First operand 731 states and 1861 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:22,648 INFO L93 Difference]: Finished difference Result 1026 states and 2436 transitions. [2022-11-02 20:20:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:22,653 INFO L225 Difference]: With dead ends: 1026 [2022-11-02 20:20:22,653 INFO L226 Difference]: Without dead ends: 1008 [2022-11-02 20:20:22,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:20:22,654 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:22,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 6 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:20:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-11-02 20:20:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 732. [2022-11-02 20:20:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 716 states have (on average 2.5824022346368714) internal successors, (1849), 731 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1849 transitions. [2022-11-02 20:20:22,680 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1849 transitions. Word has length 11 [2022-11-02 20:20:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:22,680 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1849 transitions. [2022-11-02 20:20:22,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1849 transitions. [2022-11-02 20:20:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:22,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:22,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:22,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:20:22,683 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:22,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1434248196, now seen corresponding path program 2 times [2022-11-02 20:20:22,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:22,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176239374] [2022-11-02 20:20:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:22,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176239374] [2022-11-02 20:20:23,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176239374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:23,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:23,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:23,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210609881] [2022-11-02 20:20:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:23,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:23,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:23,298 INFO L87 Difference]: Start difference. First operand 732 states and 1849 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:20:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:24,031 INFO L93 Difference]: Finished difference Result 1194 states and 2894 transitions. [2022-11-02 20:20:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:20:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:24,036 INFO L225 Difference]: With dead ends: 1194 [2022-11-02 20:20:24,036 INFO L226 Difference]: Without dead ends: 1194 [2022-11-02 20:20:24,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:24,037 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 153 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:24,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 20 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2022-11-02 20:20:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 934. [2022-11-02 20:20:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 918 states have (on average 2.6122004357298474) internal successors, (2398), 933 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2398 transitions. [2022-11-02 20:20:24,068 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2398 transitions. Word has length 11 [2022-11-02 20:20:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:24,068 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2398 transitions. [2022-11-02 20:20:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:20:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2398 transitions. [2022-11-02 20:20:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:24,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:24,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:20:24,071 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1297982768, now seen corresponding path program 1 times [2022-11-02 20:20:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:24,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323175757] [2022-11-02 20:20:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:25,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323175757] [2022-11-02 20:20:25,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323175757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:25,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:25,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647573136] [2022-11-02 20:20:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:20:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:20:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:25,148 INFO L87 Difference]: Start difference. First operand 934 states and 2398 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:20:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:26,158 INFO L93 Difference]: Finished difference Result 957 states and 2434 transitions. [2022-11-02 20:20:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:26,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:20:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:26,162 INFO L225 Difference]: With dead ends: 957 [2022-11-02 20:20:26,163 INFO L226 Difference]: Without dead ends: 957 [2022-11-02 20:20:26,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:20:26,164 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:26,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-11-02 20:20:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 934. [2022-11-02 20:20:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 918 states have (on average 2.610021786492375) internal successors, (2396), 933 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2396 transitions. [2022-11-02 20:20:26,193 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2396 transitions. Word has length 11 [2022-11-02 20:20:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:26,194 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2396 transitions. [2022-11-02 20:20:26,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:20:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2396 transitions. [2022-11-02 20:20:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:26,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:26,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:26,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:20:26,196 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1297997617, now seen corresponding path program 2 times [2022-11-02 20:20:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:26,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062781766] [2022-11-02 20:20:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:27,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:27,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062781766] [2022-11-02 20:20:27,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062781766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:27,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:27,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144905590] [2022-11-02 20:20:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:27,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:27,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:27,116 INFO L87 Difference]: Start difference. First operand 934 states and 2396 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:28,098 INFO L93 Difference]: Finished difference Result 1119 states and 2741 transitions. [2022-11-02 20:20:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:20:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:28,103 INFO L225 Difference]: With dead ends: 1119 [2022-11-02 20:20:28,104 INFO L226 Difference]: Without dead ends: 1103 [2022-11-02 20:20:28,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:28,105 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:28,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 6 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:20:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2022-11-02 20:20:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 970. [2022-11-02 20:20:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 954 states have (on average 2.5953878406708597) internal successors, (2476), 969 states have internal predecessors, (2476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2476 transitions. [2022-11-02 20:20:28,137 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2476 transitions. Word has length 11 [2022-11-02 20:20:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:28,137 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 2476 transitions. [2022-11-02 20:20:28,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2476 transitions. [2022-11-02 20:20:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:28,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:28,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:28,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:20:28,139 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1279456069, now seen corresponding path program 3 times [2022-11-02 20:20:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453465136] [2022-11-02 20:20:28,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:28,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453465136] [2022-11-02 20:20:29,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453465136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:29,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:29,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887920041] [2022-11-02 20:20:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:29,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:29,072 INFO L87 Difference]: Start difference. First operand 970 states and 2476 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:30,639 INFO L93 Difference]: Finished difference Result 1632 states and 3889 transitions. [2022-11-02 20:20:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:20:30,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:30,646 INFO L225 Difference]: With dead ends: 1632 [2022-11-02 20:20:30,646 INFO L226 Difference]: Without dead ends: 1632 [2022-11-02 20:20:30,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:20:30,647 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 102 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:30,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 12 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:20:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2022-11-02 20:20:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1013. [2022-11-02 20:20:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 997 states have (on average 2.595787362086259) internal successors, (2588), 1012 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2588 transitions. [2022-11-02 20:20:30,686 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2588 transitions. Word has length 11 [2022-11-02 20:20:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:30,686 INFO L495 AbstractCegarLoop]: Abstraction has 1013 states and 2588 transitions. [2022-11-02 20:20:30,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2588 transitions. [2022-11-02 20:20:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:30,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:30,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:30,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:20:30,688 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1279456068, now seen corresponding path program 3 times [2022-11-02 20:20:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:30,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692983601] [2022-11-02 20:20:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:31,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692983601] [2022-11-02 20:20:31,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692983601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:31,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:31,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:31,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829974875] [2022-11-02 20:20:31,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:31,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:31,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:31,553 INFO L87 Difference]: Start difference. First operand 1013 states and 2588 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:32,755 INFO L93 Difference]: Finished difference Result 1684 states and 3985 transitions. [2022-11-02 20:20:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:20:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:32,762 INFO L225 Difference]: With dead ends: 1684 [2022-11-02 20:20:32,762 INFO L226 Difference]: Without dead ends: 1666 [2022-11-02 20:20:32,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:20:32,764 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:32,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 12 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:20:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-11-02 20:20:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 970. [2022-11-02 20:20:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 954 states have (on average 2.5943396226415096) internal successors, (2475), 969 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2475 transitions. [2022-11-02 20:20:32,809 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2475 transitions. Word has length 11 [2022-11-02 20:20:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:32,809 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 2475 transitions. [2022-11-02 20:20:32,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2475 transitions. [2022-11-02 20:20:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:32,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:32,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:32,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:20:32,811 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1299118129, now seen corresponding path program 4 times [2022-11-02 20:20:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:32,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789725608] [2022-11-02 20:20:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:33,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:33,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789725608] [2022-11-02 20:20:33,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789725608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:33,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:33,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863390528] [2022-11-02 20:20:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:33,672 INFO L87 Difference]: Start difference. First operand 970 states and 2475 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:35,161 INFO L93 Difference]: Finished difference Result 1381 states and 3360 transitions. [2022-11-02 20:20:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:20:35,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:35,166 INFO L225 Difference]: With dead ends: 1381 [2022-11-02 20:20:35,166 INFO L226 Difference]: Without dead ends: 1381 [2022-11-02 20:20:35,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:20:35,167 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 78 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:35,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 6 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:20:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2022-11-02 20:20:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 972. [2022-11-02 20:20:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 956 states have (on average 2.592050209205021) internal successors, (2478), 971 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 2478 transitions. [2022-11-02 20:20:35,200 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 2478 transitions. Word has length 11 [2022-11-02 20:20:35,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:35,200 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 2478 transitions. [2022-11-02 20:20:35,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 2478 transitions. [2022-11-02 20:20:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:35,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:35,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:20:35,202 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:35,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1299118128, now seen corresponding path program 4 times [2022-11-02 20:20:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:35,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914379838] [2022-11-02 20:20:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:35,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:36,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914379838] [2022-11-02 20:20:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914379838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:36,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:36,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891372221] [2022-11-02 20:20:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:36,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:36,054 INFO L87 Difference]: Start difference. First operand 972 states and 2478 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:37,288 INFO L93 Difference]: Finished difference Result 1462 states and 3511 transitions. [2022-11-02 20:20:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:37,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:37,294 INFO L225 Difference]: With dead ends: 1462 [2022-11-02 20:20:37,294 INFO L226 Difference]: Without dead ends: 1462 [2022-11-02 20:20:37,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:37,295 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:37,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 6 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:20:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-11-02 20:20:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 972. [2022-11-02 20:20:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 956 states have (on average 2.592050209205021) internal successors, (2478), 971 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 2478 transitions. [2022-11-02 20:20:37,330 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 2478 transitions. Word has length 11 [2022-11-02 20:20:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:37,330 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 2478 transitions. [2022-11-02 20:20:37,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 2478 transitions. [2022-11-02 20:20:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:37,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:37,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:37,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:20:37,333 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:37,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:37,333 INFO L85 PathProgramCache]: Analyzing trace with hash -775283739, now seen corresponding path program 5 times [2022-11-02 20:20:37,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:37,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695021515] [2022-11-02 20:20:37,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:37,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:38,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695021515] [2022-11-02 20:20:38,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695021515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:38,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:38,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647888322] [2022-11-02 20:20:38,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:38,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:38,102 INFO L87 Difference]: Start difference. First operand 972 states and 2478 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:39,229 INFO L93 Difference]: Finished difference Result 1371 states and 3337 transitions. [2022-11-02 20:20:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:20:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:39,233 INFO L225 Difference]: With dead ends: 1371 [2022-11-02 20:20:39,234 INFO L226 Difference]: Without dead ends: 1371 [2022-11-02 20:20:39,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:20:39,235 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 104 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:39,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 6 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-11-02 20:20:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 968. [2022-11-02 20:20:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 952 states have (on average 2.592436974789916) internal successors, (2468), 967 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 2468 transitions. [2022-11-02 20:20:39,263 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 2468 transitions. Word has length 11 [2022-11-02 20:20:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:39,264 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 2468 transitions. [2022-11-02 20:20:39,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 2468 transitions. [2022-11-02 20:20:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:39,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:39,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:39,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:20:39,266 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:39,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash -775283738, now seen corresponding path program 5 times [2022-11-02 20:20:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:39,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211171276] [2022-11-02 20:20:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:39,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:39,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211171276] [2022-11-02 20:20:39,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211171276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:39,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:39,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321644686] [2022-11-02 20:20:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:39,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:39,968 INFO L87 Difference]: Start difference. First operand 968 states and 2468 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:41,291 INFO L93 Difference]: Finished difference Result 1409 states and 3405 transitions. [2022-11-02 20:20:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:41,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:41,295 INFO L225 Difference]: With dead ends: 1409 [2022-11-02 20:20:41,295 INFO L226 Difference]: Without dead ends: 1409 [2022-11-02 20:20:41,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:41,296 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 67 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 6 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:20:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-11-02 20:20:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 966. [2022-11-02 20:20:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 950 states have (on average 2.594736842105263) internal successors, (2465), 965 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2465 transitions. [2022-11-02 20:20:41,358 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2465 transitions. Word has length 11 [2022-11-02 20:20:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:41,359 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 2465 transitions. [2022-11-02 20:20:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2465 transitions. [2022-11-02 20:20:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:41,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:41,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:41,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:20:41,361 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash -285280376, now seen corresponding path program 3 times [2022-11-02 20:20:41,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:41,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451945713] [2022-11-02 20:20:41,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:41,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451945713] [2022-11-02 20:20:41,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451945713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:41,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:41,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697535919] [2022-11-02 20:20:41,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:41,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:41,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:41,834 INFO L87 Difference]: Start difference. First operand 966 states and 2465 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:42,503 INFO L93 Difference]: Finished difference Result 1419 states and 3455 transitions. [2022-11-02 20:20:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:42,507 INFO L225 Difference]: With dead ends: 1419 [2022-11-02 20:20:42,507 INFO L226 Difference]: Without dead ends: 1419 [2022-11-02 20:20:42,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:42,508 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 125 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:42,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 6 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-11-02 20:20:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 986. [2022-11-02 20:20:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 970 states have (on average 2.6030927835051547) internal successors, (2525), 985 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2525 transitions. [2022-11-02 20:20:42,540 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2525 transitions. Word has length 11 [2022-11-02 20:20:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:42,541 INFO L495 AbstractCegarLoop]: Abstraction has 986 states and 2525 transitions. [2022-11-02 20:20:42,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2525 transitions. [2022-11-02 20:20:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:42,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:42,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:42,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:20:42,543 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash -278361176, now seen corresponding path program 4 times [2022-11-02 20:20:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:42,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490921740] [2022-11-02 20:20:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:43,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:43,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490921740] [2022-11-02 20:20:43,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490921740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:43,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:43,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321052523] [2022-11-02 20:20:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:43,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:43,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:43,063 INFO L87 Difference]: Start difference. First operand 986 states and 2525 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:43,961 INFO L93 Difference]: Finished difference Result 1874 states and 4535 transitions. [2022-11-02 20:20:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:43,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:43,971 INFO L225 Difference]: With dead ends: 1874 [2022-11-02 20:20:43,972 INFO L226 Difference]: Without dead ends: 1874 [2022-11-02 20:20:43,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:20:43,982 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 199 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:43,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 8 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-11-02 20:20:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 994. [2022-11-02 20:20:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 978 states have (on average 2.6063394683026586) internal successors, (2549), 993 states have internal predecessors, (2549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 2549 transitions. [2022-11-02 20:20:44,015 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 2549 transitions. Word has length 11 [2022-11-02 20:20:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:44,015 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 2549 transitions. [2022-11-02 20:20:44,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 2549 transitions. [2022-11-02 20:20:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:44,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:44,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:44,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:20:44,017 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash -440789365, now seen corresponding path program 4 times [2022-11-02 20:20:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:44,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776725297] [2022-11-02 20:20:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:44,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:44,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776725297] [2022-11-02 20:20:44,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776725297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:44,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:44,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:44,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225507445] [2022-11-02 20:20:44,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:44,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:44,569 INFO L87 Difference]: Start difference. First operand 994 states and 2549 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:45,493 INFO L93 Difference]: Finished difference Result 1636 states and 3973 transitions. [2022-11-02 20:20:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:45,498 INFO L225 Difference]: With dead ends: 1636 [2022-11-02 20:20:45,498 INFO L226 Difference]: Without dead ends: 1636 [2022-11-02 20:20:45,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:45,499 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 174 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:45,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 6 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-11-02 20:20:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 988. [2022-11-02 20:20:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 972 states have (on average 2.603909465020576) internal successors, (2531), 987 states have internal predecessors, (2531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2531 transitions. [2022-11-02 20:20:45,528 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2531 transitions. Word has length 11 [2022-11-02 20:20:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:45,529 INFO L495 AbstractCegarLoop]: Abstraction has 988 states and 2531 transitions. [2022-11-02 20:20:45,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2531 transitions. [2022-11-02 20:20:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:45,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:45,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:45,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:20:45,531 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -438953545, now seen corresponding path program 5 times [2022-11-02 20:20:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:45,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242804200] [2022-11-02 20:20:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:46,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242804200] [2022-11-02 20:20:46,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242804200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:46,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:46,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261131183] [2022-11-02 20:20:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:46,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:46,032 INFO L87 Difference]: Start difference. First operand 988 states and 2531 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:46,701 INFO L93 Difference]: Finished difference Result 1432 states and 3483 transitions. [2022-11-02 20:20:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:46,704 INFO L225 Difference]: With dead ends: 1432 [2022-11-02 20:20:46,704 INFO L226 Difference]: Without dead ends: 1432 [2022-11-02 20:20:46,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:20:46,705 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 134 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:46,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 6 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-11-02 20:20:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 996. [2022-11-02 20:20:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 980 states have (on average 2.607142857142857) internal successors, (2555), 995 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 2555 transitions. [2022-11-02 20:20:46,734 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 2555 transitions. Word has length 11 [2022-11-02 20:20:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:46,734 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 2555 transitions. [2022-11-02 20:20:46,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 2555 transitions. [2022-11-02 20:20:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:46,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:46,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:46,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:20:46,736 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash -221517685, now seen corresponding path program 6 times [2022-11-02 20:20:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:46,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271366124] [2022-11-02 20:20:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271366124] [2022-11-02 20:20:47,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271366124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:47,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:47,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076574345] [2022-11-02 20:20:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:47,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:47,249 INFO L87 Difference]: Start difference. First operand 996 states and 2555 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:47,821 INFO L93 Difference]: Finished difference Result 1761 states and 4278 transitions. [2022-11-02 20:20:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:47,825 INFO L225 Difference]: With dead ends: 1761 [2022-11-02 20:20:47,825 INFO L226 Difference]: Without dead ends: 1761 [2022-11-02 20:20:47,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:47,826 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 175 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:47,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 8 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2022-11-02 20:20:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 992. [2022-11-02 20:20:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 976 states have (on average 2.605532786885246) internal successors, (2543), 991 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2543 transitions. [2022-11-02 20:20:47,859 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2543 transitions. Word has length 11 [2022-11-02 20:20:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:47,859 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 2543 transitions. [2022-11-02 20:20:47,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2543 transitions. [2022-11-02 20:20:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:47,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:47,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:47,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:20:47,862 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1707562266, now seen corresponding path program 6 times [2022-11-02 20:20:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:47,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848672390] [2022-11-02 20:20:47,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:48,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:48,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848672390] [2022-11-02 20:20:48,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848672390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:48,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:48,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530461151] [2022-11-02 20:20:48,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:48,611 INFO L87 Difference]: Start difference. First operand 992 states and 2543 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:49,509 INFO L93 Difference]: Finished difference Result 1327 states and 3239 transitions. [2022-11-02 20:20:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:49,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:49,512 INFO L225 Difference]: With dead ends: 1327 [2022-11-02 20:20:49,512 INFO L226 Difference]: Without dead ends: 1327 [2022-11-02 20:20:49,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:20:49,513 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:49,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 6 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:20:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-11-02 20:20:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1032. [2022-11-02 20:20:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1016 states have (on average 2.607283464566929) internal successors, (2649), 1031 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 2649 transitions. [2022-11-02 20:20:49,539 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 2649 transitions. Word has length 11 [2022-11-02 20:20:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:49,540 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 2649 transitions. [2022-11-02 20:20:49,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 2649 transitions. [2022-11-02 20:20:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:49,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:49,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:49,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:20:49,542 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1703256366, now seen corresponding path program 7 times [2022-11-02 20:20:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:49,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283335274] [2022-11-02 20:20:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:49,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:49,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283335274] [2022-11-02 20:20:49,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283335274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:49,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:49,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634496773] [2022-11-02 20:20:49,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:49,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:49,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:49,954 INFO L87 Difference]: Start difference. First operand 1032 states and 2649 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:20:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:50,531 INFO L93 Difference]: Finished difference Result 1796 states and 4324 transitions. [2022-11-02 20:20:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:20:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:20:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:50,534 INFO L225 Difference]: With dead ends: 1796 [2022-11-02 20:20:50,535 INFO L226 Difference]: Without dead ends: 1796 [2022-11-02 20:20:50,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:50,535 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 153 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:50,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 14 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2022-11-02 20:20:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1044. [2022-11-02 20:20:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1028 states have (on average 2.6313229571984436) internal successors, (2705), 1043 states have internal predecessors, (2705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2705 transitions. [2022-11-02 20:20:50,583 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2705 transitions. Word has length 11 [2022-11-02 20:20:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:50,583 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 2705 transitions. [2022-11-02 20:20:50,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:20:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2705 transitions. [2022-11-02 20:20:50,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:50,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:50,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:50,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:20:50,585 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1566990938, now seen corresponding path program 2 times [2022-11-02 20:20:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:50,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926389324] [2022-11-02 20:20:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:51,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926389324] [2022-11-02 20:20:51,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926389324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:51,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:51,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425608789] [2022-11-02 20:20:51,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:20:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:20:51,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:51,448 INFO L87 Difference]: Start difference. First operand 1044 states and 2705 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:20:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:52,434 INFO L93 Difference]: Finished difference Result 1085 states and 2788 transitions. [2022-11-02 20:20:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:20:52,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:20:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:52,437 INFO L225 Difference]: With dead ends: 1085 [2022-11-02 20:20:52,438 INFO L226 Difference]: Without dead ends: 1085 [2022-11-02 20:20:52,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:20:52,438 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:52,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2022-11-02 20:20:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1038. [2022-11-02 20:20:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1022 states have (on average 2.6320939334637963) internal successors, (2690), 1037 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 2690 transitions. [2022-11-02 20:20:52,463 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 2690 transitions. Word has length 11 [2022-11-02 20:20:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:52,464 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 2690 transitions. [2022-11-02 20:20:52,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:20:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 2690 transitions. [2022-11-02 20:20:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:52,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:52,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:52,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:20:52,466 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:52,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1567005787, now seen corresponding path program 6 times [2022-11-02 20:20:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:52,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202736709] [2022-11-02 20:20:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202736709] [2022-11-02 20:20:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202736709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:53,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:53,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732347228] [2022-11-02 20:20:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:53,175 INFO L87 Difference]: Start difference. First operand 1038 states and 2690 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:54,037 INFO L93 Difference]: Finished difference Result 1229 states and 3051 transitions. [2022-11-02 20:20:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:54,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:54,040 INFO L225 Difference]: With dead ends: 1229 [2022-11-02 20:20:54,040 INFO L226 Difference]: Without dead ends: 1213 [2022-11-02 20:20:54,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:54,041 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:54,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-11-02 20:20:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1031. [2022-11-02 20:20:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1015 states have (on average 2.631527093596059) internal successors, (2671), 1030 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2671 transitions. [2022-11-02 20:20:54,068 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2671 transitions. Word has length 11 [2022-11-02 20:20:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:54,068 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 2671 transitions. [2022-11-02 20:20:54,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:20:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2671 transitions. [2022-11-02 20:20:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:54,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:54,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:54,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:20:54,071 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1599074042, now seen corresponding path program 5 times [2022-11-02 20:20:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:54,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796691688] [2022-11-02 20:20:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:54,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796691688] [2022-11-02 20:20:54,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796691688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:54,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:54,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013378269] [2022-11-02 20:20:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:54,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:54,460 INFO L87 Difference]: Start difference. First operand 1031 states and 2671 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:55,073 INFO L93 Difference]: Finished difference Result 1318 states and 3292 transitions. [2022-11-02 20:20:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:20:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:55,077 INFO L225 Difference]: With dead ends: 1318 [2022-11-02 20:20:55,077 INFO L226 Difference]: Without dead ends: 1318 [2022-11-02 20:20:55,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:55,078 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 122 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:55,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:20:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-02 20:20:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1002. [2022-11-02 20:20:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 986 states have (on average 2.6004056795131847) internal successors, (2564), 1001 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 2564 transitions. [2022-11-02 20:20:55,105 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 2564 transitions. Word has length 11 [2022-11-02 20:20:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:55,105 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 2564 transitions. [2022-11-02 20:20:55,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 2564 transitions. [2022-11-02 20:20:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:55,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:55,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:55,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:20:55,107 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1597238191, now seen corresponding path program 7 times [2022-11-02 20:20:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:55,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724128330] [2022-11-02 20:20:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:55,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724128330] [2022-11-02 20:20:55,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724128330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:55,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:55,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882554556] [2022-11-02 20:20:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:55,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:55,597 INFO L87 Difference]: Start difference. First operand 1002 states and 2564 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:56,687 INFO L93 Difference]: Finished difference Result 1369 states and 3432 transitions. [2022-11-02 20:20:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:56,690 INFO L225 Difference]: With dead ends: 1369 [2022-11-02 20:20:56,690 INFO L226 Difference]: Without dead ends: 1369 [2022-11-02 20:20:56,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:20:56,692 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:56,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2022-11-02 20:20:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 971. [2022-11-02 20:20:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 955 states have (on average 2.5769633507853404) internal successors, (2461), 970 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2461 transitions. [2022-11-02 20:20:56,715 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2461 transitions. Word has length 11 [2022-11-02 20:20:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:56,716 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 2461 transitions. [2022-11-02 20:20:56,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2461 transitions. [2022-11-02 20:20:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:56,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:56,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:56,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:20:56,718 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1614219061, now seen corresponding path program 8 times [2022-11-02 20:20:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:56,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4825277] [2022-11-02 20:20:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4825277] [2022-11-02 20:20:57,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4825277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383978867] [2022-11-02 20:20:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:57,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:57,344 INFO L87 Difference]: Start difference. First operand 971 states and 2461 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:58,020 INFO L93 Difference]: Finished difference Result 1260 states and 3142 transitions. [2022-11-02 20:20:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:58,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:58,023 INFO L225 Difference]: With dead ends: 1260 [2022-11-02 20:20:58,023 INFO L226 Difference]: Without dead ends: 1260 [2022-11-02 20:20:58,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:20:58,024 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 129 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:58,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 2 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:20:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-11-02 20:20:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 991. [2022-11-02 20:20:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 975 states have (on average 2.5856410256410256) internal successors, (2521), 990 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:58,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2521 transitions. [2022-11-02 20:20:58,049 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2521 transitions. Word has length 11 [2022-11-02 20:20:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:58,049 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 2521 transitions. [2022-11-02 20:20:58,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2521 transitions. [2022-11-02 20:20:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:58,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:58,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:58,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:20:58,052 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1614219092, now seen corresponding path program 6 times [2022-11-02 20:20:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:58,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723549389] [2022-11-02 20:20:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:58,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:58,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:58,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723549389] [2022-11-02 20:20:58,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723549389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:58,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:58,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020066962] [2022-11-02 20:20:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:58,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:58,583 INFO L87 Difference]: Start difference. First operand 991 states and 2521 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:59,607 INFO L93 Difference]: Finished difference Result 1356 states and 3393 transitions. [2022-11-02 20:20:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:20:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:59,611 INFO L225 Difference]: With dead ends: 1356 [2022-11-02 20:20:59,611 INFO L226 Difference]: Without dead ends: 1356 [2022-11-02 20:20:59,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:20:59,611 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 107 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:59,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:20:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-11-02 20:20:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 991. [2022-11-02 20:20:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 975 states have (on average 2.5856410256410256) internal successors, (2521), 990 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2521 transitions. [2022-11-02 20:20:59,632 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2521 transitions. Word has length 11 [2022-11-02 20:20:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:59,633 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 2521 transitions. [2022-11-02 20:20:59,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:20:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2521 transitions. [2022-11-02 20:20:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:20:59,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:59,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:59,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:20:59,635 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:20:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 974581573, now seen corresponding path program 9 times [2022-11-02 20:20:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:59,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762693317] [2022-11-02 20:20:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:00,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762693317] [2022-11-02 20:21:00,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762693317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:00,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:00,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932776077] [2022-11-02 20:21:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:00,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:00,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:00,217 INFO L87 Difference]: Start difference. First operand 991 states and 2521 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:01,118 INFO L93 Difference]: Finished difference Result 1293 states and 3094 transitions. [2022-11-02 20:21:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:01,121 INFO L225 Difference]: With dead ends: 1293 [2022-11-02 20:21:01,121 INFO L226 Difference]: Without dead ends: 1293 [2022-11-02 20:21:01,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:01,122 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 138 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:01,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 6 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-11-02 20:21:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 915. [2022-11-02 20:21:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 903 states have (on average 2.5437430786267994) internal successors, (2297), 914 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2297 transitions. [2022-11-02 20:21:01,164 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 2297 transitions. Word has length 11 [2022-11-02 20:21:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:01,164 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 2297 transitions. [2022-11-02 20:21:01,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 2297 transitions. [2022-11-02 20:21:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:01,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:01,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:01,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:21:01,165 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 976724262, now seen corresponding path program 7 times [2022-11-02 20:21:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:01,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247807160] [2022-11-02 20:21:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:01,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:01,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247807160] [2022-11-02 20:21:01,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247807160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:01,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:01,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141218721] [2022-11-02 20:21:01,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:01,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:01,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:01,555 INFO L87 Difference]: Start difference. First operand 915 states and 2297 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:02,189 INFO L93 Difference]: Finished difference Result 1205 states and 2886 transitions. [2022-11-02 20:21:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:21:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:02,193 INFO L225 Difference]: With dead ends: 1205 [2022-11-02 20:21:02,193 INFO L226 Difference]: Without dead ends: 1205 [2022-11-02 20:21:02,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:21:02,194 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 128 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:02,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 6 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2022-11-02 20:21:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 915. [2022-11-02 20:21:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 903 states have (on average 2.5437430786267994) internal successors, (2297), 914 states have internal predecessors, (2297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2297 transitions. [2022-11-02 20:21:02,217 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 2297 transitions. Word has length 11 [2022-11-02 20:21:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:02,217 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 2297 transitions. [2022-11-02 20:21:02,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 2297 transitions. [2022-11-02 20:21:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:02,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:02,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:02,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:21:02,220 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash 740164812, now seen corresponding path program 8 times [2022-11-02 20:21:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:02,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572762414] [2022-11-02 20:21:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:02,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:02,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572762414] [2022-11-02 20:21:02,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572762414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:02,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:02,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441048423] [2022-11-02 20:21:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:02,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:02,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:02,646 INFO L87 Difference]: Start difference. First operand 915 states and 2297 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:03,360 INFO L93 Difference]: Finished difference Result 1097 states and 2711 transitions. [2022-11-02 20:21:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:03,364 INFO L225 Difference]: With dead ends: 1097 [2022-11-02 20:21:03,364 INFO L226 Difference]: Without dead ends: 1097 [2022-11-02 20:21:03,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:03,365 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 142 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:03,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 3 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-11-02 20:21:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 863. [2022-11-02 20:21:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 851 states have (on average 2.5205640423031728) internal successors, (2145), 862 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 2145 transitions. [2022-11-02 20:21:03,395 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 2145 transitions. Word has length 11 [2022-11-02 20:21:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:03,396 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 2145 transitions. [2022-11-02 20:21:03,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 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-11-02 20:21:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 2145 transitions. [2022-11-02 20:21:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:03,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:03,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:03,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:21:03,399 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1056375026, now seen corresponding path program 3 times [2022-11-02 20:21:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221121652] [2022-11-02 20:21:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:04,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221121652] [2022-11-02 20:21:04,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221121652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:04,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:04,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231996607] [2022-11-02 20:21:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:04,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:04,285 INFO L87 Difference]: Start difference. First operand 863 states and 2145 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:05,735 INFO L93 Difference]: Finished difference Result 905 states and 2230 transitions. [2022-11-02 20:21:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:21:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:05,737 INFO L225 Difference]: With dead ends: 905 [2022-11-02 20:21:05,738 INFO L226 Difference]: Without dead ends: 905 [2022-11-02 20:21:05,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:21:05,738 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:05,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 2 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:21:05,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-11-02 20:21:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 869. [2022-11-02 20:21:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 857 states have (on average 2.5204200700116686) internal successors, (2160), 868 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2160 transitions. [2022-11-02 20:21:05,752 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2160 transitions. Word has length 11 [2022-11-02 20:21:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:05,752 INFO L495 AbstractCegarLoop]: Abstraction has 869 states and 2160 transitions. [2022-11-02 20:21:05,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2160 transitions. [2022-11-02 20:21:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:05,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:05,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:05,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:21:05,754 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1056375027, now seen corresponding path program 1 times [2022-11-02 20:21:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:05,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366896888] [2022-11-02 20:21:05,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:06,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366896888] [2022-11-02 20:21:06,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366896888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:06,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:06,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562541185] [2022-11-02 20:21:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:06,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:06,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:06,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:06,658 INFO L87 Difference]: Start difference. First operand 869 states and 2160 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:08,096 INFO L93 Difference]: Finished difference Result 1043 states and 2592 transitions. [2022-11-02 20:21:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:21:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:08,101 INFO L225 Difference]: With dead ends: 1043 [2022-11-02 20:21:08,102 INFO L226 Difference]: Without dead ends: 1043 [2022-11-02 20:21:08,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:21:08,103 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:08,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:21:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-11-02 20:21:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 873. [2022-11-02 20:21:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 861 states have (on average 2.518002322880372) internal successors, (2168), 872 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2168 transitions. [2022-11-02 20:21:08,120 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2168 transitions. Word has length 11 [2022-11-02 20:21:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:08,120 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 2168 transitions. [2022-11-02 20:21:08,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2168 transitions. [2022-11-02 20:21:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:08,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:08,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:08,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:21:08,122 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1058470347, now seen corresponding path program 7 times [2022-11-02 20:21:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:08,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814805042] [2022-11-02 20:21:08,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:08,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814805042] [2022-11-02 20:21:08,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814805042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:08,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:08,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:08,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270561189] [2022-11-02 20:21:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:08,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:08,768 INFO L87 Difference]: Start difference. First operand 873 states and 2168 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:21:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:09,706 INFO L93 Difference]: Finished difference Result 1082 states and 2574 transitions. [2022-11-02 20:21:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:21:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:21:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:09,709 INFO L225 Difference]: With dead ends: 1082 [2022-11-02 20:21:09,709 INFO L226 Difference]: Without dead ends: 1082 [2022-11-02 20:21:09,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:09,709 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:09,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 6 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:21:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-11-02 20:21:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 908. [2022-11-02 20:21:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 896 states have (on average 2.525669642857143) internal successors, (2263), 907 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 2263 transitions. [2022-11-02 20:21:09,736 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 2263 transitions. Word has length 11 [2022-11-02 20:21:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:09,736 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 2263 transitions. [2022-11-02 20:21:09,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11-02 20:21:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2263 transitions. [2022-11-02 20:21:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:09,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:09,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:09,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:21:09,740 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:09,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1058470348, now seen corresponding path program 8 times [2022-11-02 20:21:09,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:09,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206770577] [2022-11-02 20:21:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:09,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206770577] [2022-11-02 20:21:10,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206770577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:10,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:10,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797178331] [2022-11-02 20:21:10,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:10,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:10,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:10,118 INFO L87 Difference]: Start difference. First operand 908 states and 2263 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:21:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:10,665 INFO L93 Difference]: Finished difference Result 1091 states and 2560 transitions. [2022-11-02 20:21:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:21:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:21:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:10,668 INFO L225 Difference]: With dead ends: 1091 [2022-11-02 20:21:10,668 INFO L226 Difference]: Without dead ends: 1075 [2022-11-02 20:21:10,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:21:10,669 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 120 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:10,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 12 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-11-02 20:21:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 706. [2022-11-02 20:21:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 695 states have (on average 2.4388489208633093) internal successors, (1695), 705 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1695 transitions. [2022-11-02 20:21:10,682 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1695 transitions. Word has length 11 [2022-11-02 20:21:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:10,682 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 1695 transitions. [2022-11-02 20:21:10,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-11-02 20:21:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1695 transitions. [2022-11-02 20:21:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:10,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:10,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:10,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:21:10,684 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:10,685 INFO L85 PathProgramCache]: Analyzing trace with hash 862136532, now seen corresponding path program 4 times [2022-11-02 20:21:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:10,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911858053] [2022-11-02 20:21:10,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:10,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911858053] [2022-11-02 20:21:11,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911858053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:11,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:11,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078129726] [2022-11-02 20:21:11,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:11,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:11,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:11,486 INFO L87 Difference]: Start difference. First operand 706 states and 1695 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:13,079 INFO L93 Difference]: Finished difference Result 726 states and 1745 transitions. [2022-11-02 20:21:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:21:13,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:13,081 INFO L225 Difference]: With dead ends: 726 [2022-11-02 20:21:13,081 INFO L226 Difference]: Without dead ends: 726 [2022-11-02 20:21:13,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:21:13,081 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:13,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:21:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-11-02 20:21:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 704. [2022-11-02 20:21:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 693 states have (on average 2.4386724386724388) internal successors, (1690), 703 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1690 transitions. [2022-11-02 20:21:13,093 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1690 transitions. Word has length 11 [2022-11-02 20:21:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:13,093 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 1690 transitions. [2022-11-02 20:21:13,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1690 transitions. [2022-11-02 20:21:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:21:13,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:13,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:13,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:21:13,095 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 857725542, now seen corresponding path program 5 times [2022-11-02 20:21:13,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:13,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997306336] [2022-11-02 20:21:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:13,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997306336] [2022-11-02 20:21:13,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997306336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:13,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:13,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:13,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468298836] [2022-11-02 20:21:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:13,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:13,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:13,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:13,879 INFO L87 Difference]: Start difference. First operand 704 states and 1690 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:15,182 INFO L93 Difference]: Finished difference Result 731 states and 1758 transitions. [2022-11-02 20:21:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:21:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:15,184 INFO L225 Difference]: With dead ends: 731 [2022-11-02 20:21:15,184 INFO L226 Difference]: Without dead ends: 731 [2022-11-02 20:21:15,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:21:15,184 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:15,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-11-02 20:21:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 698. [2022-11-02 20:21:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 687 states have (on average 2.441048034934498) internal successors, (1677), 697 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1677 transitions. [2022-11-02 20:21:15,195 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1677 transitions. Word has length 11 [2022-11-02 20:21:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:15,195 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1677 transitions. [2022-11-02 20:21:15,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-11-02 20:21:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1677 transitions. [2022-11-02 20:21:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:15,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:15,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:15,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:21:15,196 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -427475421, now seen corresponding path program 1 times [2022-11-02 20:21:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:15,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732050056] [2022-11-02 20:21:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:16,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732050056] [2022-11-02 20:21:16,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732050056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:16,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:16,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458168979] [2022-11-02 20:21:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:16,085 INFO L87 Difference]: Start difference. First operand 698 states and 1677 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:17,616 INFO L93 Difference]: Finished difference Result 1196 states and 2751 transitions. [2022-11-02 20:21:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:21:17,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:17,619 INFO L225 Difference]: With dead ends: 1196 [2022-11-02 20:21:17,619 INFO L226 Difference]: Without dead ends: 1196 [2022-11-02 20:21:17,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:21:17,620 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 80 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:17,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 3 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:21:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-11-02 20:21:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 748. [2022-11-02 20:21:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 737 states have (on average 2.4559023066485755) internal successors, (1810), 747 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1810 transitions. [2022-11-02 20:21:17,640 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1810 transitions. Word has length 12 [2022-11-02 20:21:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:17,640 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1810 transitions. [2022-11-02 20:21:17,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1810 transitions. [2022-11-02 20:21:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:17,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:17,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:17,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 20:21:17,642 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -427475420, now seen corresponding path program 1 times [2022-11-02 20:21:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887601885] [2022-11-02 20:21:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:18,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:18,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887601885] [2022-11-02 20:21:18,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887601885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:18,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:18,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964307338] [2022-11-02 20:21:18,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:18,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:18,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:18,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:18,370 INFO L87 Difference]: Start difference. First operand 748 states and 1810 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:19,653 INFO L93 Difference]: Finished difference Result 1257 states and 2918 transitions. [2022-11-02 20:21:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:19,656 INFO L225 Difference]: With dead ends: 1257 [2022-11-02 20:21:19,656 INFO L226 Difference]: Without dead ends: 1239 [2022-11-02 20:21:19,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:21:19,657 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:19,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:21:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-11-02 20:21:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 706. [2022-11-02 20:21:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 695 states have (on average 2.446043165467626) internal successors, (1700), 705 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1700 transitions. [2022-11-02 20:21:19,670 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1700 transitions. Word has length 12 [2022-11-02 20:21:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:19,671 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 1700 transitions. [2022-11-02 20:21:19,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1700 transitions. [2022-11-02 20:21:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:19,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:19,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:19,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:21:19,672 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -510600588, now seen corresponding path program 1 times [2022-11-02 20:21:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:19,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738441753] [2022-11-02 20:21:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:19,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738441753] [2022-11-02 20:21:19,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738441753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:19,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:19,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351225913] [2022-11-02 20:21:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:19,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:19,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:19,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:19,749 INFO L87 Difference]: Start difference. First operand 706 states and 1700 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:19,849 INFO L93 Difference]: Finished difference Result 404 states and 916 transitions. [2022-11-02 20:21:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:21:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:19,851 INFO L225 Difference]: With dead ends: 404 [2022-11-02 20:21:19,851 INFO L226 Difference]: Without dead ends: 386 [2022-11-02 20:21:19,851 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-11-02 20:21:19,852 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:19,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-02 20:21:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 320. [2022-11-02 20:21:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 317 states have (on average 2.2965299684542586) internal successors, (728), 319 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 728 transitions. [2022-11-02 20:21:19,860 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 728 transitions. Word has length 12 [2022-11-02 20:21:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:19,860 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 728 transitions. [2022-11-02 20:21:19,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 728 transitions. [2022-11-02 20:21:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:19,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:19,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:19,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 20:21:19,862 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:19,863 INFO L85 PathProgramCache]: Analyzing trace with hash -286904092, now seen corresponding path program 1 times [2022-11-02 20:21:19,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:19,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203594258] [2022-11-02 20:21:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:20,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:20,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203594258] [2022-11-02 20:21:20,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203594258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:20,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:20,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:21:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299080970] [2022-11-02 20:21:20,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:20,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:21:20,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:21:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:21:20,932 INFO L87 Difference]: Start difference. First operand 320 states and 728 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-11-02 20:21:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:21,645 INFO L93 Difference]: Finished difference Result 359 states and 822 transitions. [2022-11-02 20:21:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:21,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-11-02 20:21:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:21,646 INFO L225 Difference]: With dead ends: 359 [2022-11-02 20:21:21,646 INFO L226 Difference]: Without dead ends: 355 [2022-11-02 20:21:21,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:21:21,647 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:21,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-02 20:21:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 332. [2022-11-02 20:21:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 329 states have (on average 2.310030395136778) internal successors, (760), 331 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 760 transitions. [2022-11-02 20:21:21,655 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 760 transitions. Word has length 12 [2022-11-02 20:21:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:21,655 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 760 transitions. [2022-11-02 20:21:21,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-11-02 20:21:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 760 transitions. [2022-11-02 20:21:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:21,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:21,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:21,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-02 20:21:21,657 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:21,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:21,657 INFO L85 PathProgramCache]: Analyzing trace with hash -286918941, now seen corresponding path program 2 times [2022-11-02 20:21:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:21,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835380318] [2022-11-02 20:21:21,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:21,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:22,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:22,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835380318] [2022-11-02 20:21:22,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835380318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:22,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:22,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60020907] [2022-11-02 20:21:22,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:22,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:22,405 INFO L87 Difference]: Start difference. First operand 332 states and 760 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:23,223 INFO L93 Difference]: Finished difference Result 460 states and 997 transitions. [2022-11-02 20:21:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:21:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:23,225 INFO L225 Difference]: With dead ends: 460 [2022-11-02 20:21:23,225 INFO L226 Difference]: Without dead ends: 460 [2022-11-02 20:21:23,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:23,226 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:23,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-11-02 20:21:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 330. [2022-11-02 20:21:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 327 states have (on average 2.305810397553517) internal successors, (754), 329 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 754 transitions. [2022-11-02 20:21:23,234 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 754 transitions. Word has length 12 [2022-11-02 20:21:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:23,234 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 754 transitions. [2022-11-02 20:21:23,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 754 transitions. [2022-11-02 20:21:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:23,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:23,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:23,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-02 20:21:23,236 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1645939061, now seen corresponding path program 3 times [2022-11-02 20:21:23,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:23,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152649220] [2022-11-02 20:21:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:23,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152649220] [2022-11-02 20:21:23,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152649220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:23,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:23,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178100628] [2022-11-02 20:21:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:23,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:23,941 INFO L87 Difference]: Start difference. First operand 330 states and 754 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:25,117 INFO L93 Difference]: Finished difference Result 591 states and 1243 transitions. [2022-11-02 20:21:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:21:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:25,119 INFO L225 Difference]: With dead ends: 591 [2022-11-02 20:21:25,119 INFO L226 Difference]: Without dead ends: 559 [2022-11-02 20:21:25,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:21:25,120 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:25,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:21:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-11-02 20:21:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 381. [2022-11-02 20:21:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 2.25531914893617) internal successors, (848), 380 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 848 transitions. [2022-11-02 20:21:25,127 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 848 transitions. Word has length 12 [2022-11-02 20:21:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:25,127 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 848 transitions. [2022-11-02 20:21:25,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 848 transitions. [2022-11-02 20:21:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:25,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:25,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:25,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-02 20:21:25,129 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:25,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1645501961, now seen corresponding path program 4 times [2022-11-02 20:21:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:25,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936868408] [2022-11-02 20:21:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:25,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:25,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:25,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936868408] [2022-11-02 20:21:25,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936868408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:25,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:25,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538105094] [2022-11-02 20:21:25,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:25,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:25,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:25,886 INFO L87 Difference]: Start difference. First operand 381 states and 848 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:27,045 INFO L93 Difference]: Finished difference Result 511 states and 1072 transitions. [2022-11-02 20:21:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:21:27,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:27,047 INFO L225 Difference]: With dead ends: 511 [2022-11-02 20:21:27,047 INFO L226 Difference]: Without dead ends: 507 [2022-11-02 20:21:27,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:21:27,048 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:27,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-02 20:21:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 376. [2022-11-02 20:21:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 371 states have (on average 2.247978436657682) internal successors, (834), 375 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 834 transitions. [2022-11-02 20:21:27,054 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 834 transitions. Word has length 12 [2022-11-02 20:21:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:27,054 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 834 transitions. [2022-11-02 20:21:27,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 834 transitions. [2022-11-02 20:21:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:27,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:27,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:27,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-02 20:21:27,055 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1582757128, now seen corresponding path program 2 times [2022-11-02 20:21:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:27,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108715632] [2022-11-02 20:21:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:28,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108715632] [2022-11-02 20:21:28,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108715632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:28,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:28,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797883991] [2022-11-02 20:21:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:28,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:28,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:28,075 INFO L87 Difference]: Start difference. First operand 376 states and 834 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:28,946 INFO L93 Difference]: Finished difference Result 405 states and 900 transitions. [2022-11-02 20:21:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:28,947 INFO L225 Difference]: With dead ends: 405 [2022-11-02 20:21:28,947 INFO L226 Difference]: Without dead ends: 397 [2022-11-02 20:21:28,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:28,948 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:28,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-02 20:21:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 376. [2022-11-02 20:21:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 371 states have (on average 2.242587601078167) internal successors, (832), 375 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 832 transitions. [2022-11-02 20:21:28,956 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 832 transitions. Word has length 12 [2022-11-02 20:21:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:28,956 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 832 transitions. [2022-11-02 20:21:28,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 832 transitions. [2022-11-02 20:21:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:28,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:28,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-02 20:21:28,957 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1008867489, now seen corresponding path program 5 times [2022-11-02 20:21:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:28,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720142953] [2022-11-02 20:21:28,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720142953] [2022-11-02 20:21:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720142953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:29,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:29,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031730153] [2022-11-02 20:21:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:29,652 INFO L87 Difference]: Start difference. First operand 376 states and 832 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:30,875 INFO L93 Difference]: Finished difference Result 570 states and 1182 transitions. [2022-11-02 20:21:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:21:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:30,877 INFO L225 Difference]: With dead ends: 570 [2022-11-02 20:21:30,877 INFO L226 Difference]: Without dead ends: 558 [2022-11-02 20:21:30,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:21:30,878 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:30,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-02 20:21:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 375. [2022-11-02 20:21:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 2.2378378378378376) internal successors, (828), 374 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 828 transitions. [2022-11-02 20:21:30,886 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 828 transitions. Word has length 12 [2022-11-02 20:21:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:30,886 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 828 transitions. [2022-11-02 20:21:30,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11-02 20:21:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 828 transitions. [2022-11-02 20:21:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:30,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:30,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:30,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-02 20:21:30,887 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:21:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1008430389, now seen corresponding path program 6 times [2022-11-02 20:21:30,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:30,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281905649] [2022-11-02 20:21:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat