./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/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_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/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_ab4c2cd5-416a-4a11-921c-a23810eea929/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 44a86740b4b3d791346dd5ab0675f134d34312247f7633c0f06bf117457d4ce2 --- 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:06:47,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:06:47,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:06:47,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:06:47,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:06:47,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:06:47,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:06:47,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:06:47,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:06:47,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:06:47,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:06:47,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:06:47,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:06:47,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:06:47,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:06:47,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:06:47,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:06:47,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:06:47,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:06:47,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:06:47,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:06:47,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:06:47,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:06:47,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:06:47,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:06:47,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:06:47,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:06:47,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:06:47,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:06:47,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:06:47,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:06:47,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:06:47,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:06:47,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:06:47,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:06:47,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:06:47,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:06:47,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:06:47,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:06:47,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:06:47,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:06:47,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:06:47,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:06:47,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:06:47,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:06:47,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:06:47,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:06:47,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:06:47,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:06:47,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:06:47,614 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:06:47,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:06:47,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:06:47,616 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:06:47,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:06:47,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:06:47,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:06:47,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:06:47,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:06:47,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:06:47,618 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:06:47,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:06:47,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:06:47,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:06:47,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:06:47,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:06:47,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:06:47,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:06:47,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:06:47,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:06:47,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:06:47,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:06:47,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:06:47,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:06:47,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:06:47,622 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_ab4c2cd5-416a-4a11-921c-a23810eea929/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_ab4c2cd5-416a-4a11-921c-a23810eea929/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 -> 44a86740b4b3d791346dd5ab0675f134d34312247f7633c0f06bf117457d4ce2 [2022-11-02 20:06:48,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:06:48,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:06:48,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:06:48,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:06:48,095 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:06:48,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2022-11-02 20:06:48,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/data/8ca32f4b4/a2ae56f3ed3041369cdabede429a22e7/FLAG4510abc82 [2022-11-02 20:06:48,815 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:06:48,816 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2022-11-02 20:06:48,824 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/data/8ca32f4b4/a2ae56f3ed3041369cdabede429a22e7/FLAG4510abc82 [2022-11-02 20:06:49,162 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/data/8ca32f4b4/a2ae56f3ed3041369cdabede429a22e7 [2022-11-02 20:06:49,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:06:49,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:06:49,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:06:49,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:06:49,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:06:49,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f75860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49, skipping insertion in model container [2022-11-02 20:06:49,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:06:49,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:06:49,459 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_ab4c2cd5-416a-4a11-921c-a23810eea929/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3481,3494] [2022-11-02 20:06:49,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:06:49,479 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:06:49,510 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_ab4c2cd5-416a-4a11-921c-a23810eea929/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3481,3494] [2022-11-02 20:06:49,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:06:49,531 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:06:49,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49 WrapperNode [2022-11-02 20:06:49,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:06:49,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:06:49,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:06:49,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:06:49,543 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:06:49" (1/1) ... [2022-11-02 20:06:49,555 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:06:49" (1/1) ... [2022-11-02 20:06:49,606 INFO L138 Inliner]: procedures = 23, calls = 45, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 517 [2022-11-02 20:06:49,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:06:49,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:06:49,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:06:49,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:06:49,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:06:49,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:06:49,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:06:49,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:06:49,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (1/1) ... [2022-11-02 20:06:49,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:06:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:06:49,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:06:49,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:06:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:06:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:06:49,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:06:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:06:49,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:06:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:06:49,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:06:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:06:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:06:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:06:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:06:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:06:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:06:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:06:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:06:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:06:49,780 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:06:50,017 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:06:50,020 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:06:51,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:06:58,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:06:58,013 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:06:58,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:06:58 BoogieIcfgContainer [2022-11-02 20:06:58,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:06:58,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:06:58,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:06:58,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:06:58,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:06:49" (1/3) ... [2022-11-02 20:06:58,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73846b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:06:58, skipping insertion in model container [2022-11-02 20:06:58,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:06:49" (2/3) ... [2022-11-02 20:06:58,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73846b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:06:58, skipping insertion in model container [2022-11-02 20:06:58,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:06:58" (3/3) ... [2022-11-02 20:06:58,028 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2022-11-02 20:06:58,041 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:06:58,056 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:06:58,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-02 20:06:58,057 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:07:00,002 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:07:00,046 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:07:00,063 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 196 transitions, 416 flow [2022-11-02 20:07:00,067 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 196 transitions, 416 flow [2022-11-02 20:07:00,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 196 transitions, 416 flow [2022-11-02 20:07:00,439 INFO L130 PetriNetUnfolder]: 1/193 cut-off events. [2022-11-02 20:07:00,439 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:07:00,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 1/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 542 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-02 20:07:00,449 INFO L118 LiptonReduction]: Number of co-enabled transitions 6318 [2022-11-02 20:07:08,269 WARN L234 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 1135 DAG size of output: 442 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:07:21,649 WARN L234 SmtUtils]: Spent 11.82s on a formula simplification. DAG size of input: 1335 DAG size of output: 599 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:07:36,731 WARN L234 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 836 DAG size of output: 439 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:07:59,045 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 1016 DAG size of output: 418 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:08:09,991 WARN L234 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 1073 DAG size of output: 542 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:08:17,285 INFO L133 LiptonReduction]: Checked pairs total: 4799 [2022-11-02 20:08:17,286 INFO L135 LiptonReduction]: Total number of compositions: 111 [2022-11-02 20:08:17,294 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 91 transitions, 206 flow [2022-11-02 20:08:18,410 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 0 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:08:18,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:08:18,436 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;@280ce36d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:08:18,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-11-02 20:08:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 0 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:08:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:18,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:18,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:18,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2660362, now seen corresponding path program 1 times [2022-11-02 20:08:18,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:18,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952629624] [2022-11-02 20:08:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:18,976 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:08:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:18,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952629624] [2022-11-02 20:08:18,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952629624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:18,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:18,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906305977] [2022-11-02 20:08:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:18,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:19,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:19,092 INFO L87 Difference]: Start difference. First operand has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:19,841 INFO L93 Difference]: Finished difference Result 11660 states and 38165 transitions. [2022-11-02 20:08:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:19,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:19,972 INFO L225 Difference]: With dead ends: 11660 [2022-11-02 20:08:19,973 INFO L226 Difference]: Without dead ends: 11660 [2022-11-02 20:08:19,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:19,978 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:19,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:08:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2022-11-02 20:08:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 11660. [2022-11-02 20:08:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11660 states, 7309 states have (on average 5.221644547817759) internal successors, (38165), 11659 states have internal predecessors, (38165), 0 states have call successors, (0), 0 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:08:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11660 states to 11660 states and 38165 transitions. [2022-11-02 20:08:20,796 INFO L78 Accepts]: Start accepts. Automaton has 11660 states and 38165 transitions. Word has length 3 [2022-11-02 20:08:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:20,798 INFO L495 AbstractCegarLoop]: Abstraction has 11660 states and 38165 transitions. [2022-11-02 20:08:20,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 11660 states and 38165 transitions. [2022-11-02 20:08:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:20,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:20,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:08:20,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2660373, now seen corresponding path program 1 times [2022-11-02 20:08:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:20,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082230560] [2022-11-02 20:08:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:21,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:08:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082230560] [2022-11-02 20:08:21,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082230560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:21,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:21,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24382690] [2022-11-02 20:08:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:21,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:21,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:21,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:21,346 INFO L87 Difference]: Start difference. First operand 11660 states and 38165 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:21,899 INFO L93 Difference]: Finished difference Result 10432 states and 34047 transitions. [2022-11-02 20:08:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:21,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:21,983 INFO L225 Difference]: With dead ends: 10432 [2022-11-02 20:08:21,983 INFO L226 Difference]: Without dead ends: 10432 [2022-11-02 20:08:21,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:21,985 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:21,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:08:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10432 states. [2022-11-02 20:08:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10432 to 10432. [2022-11-02 20:08:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10432 states, 6593 states have (on average 5.164113453662976) internal successors, (34047), 10431 states have internal predecessors, (34047), 0 states have call successors, (0), 0 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:08:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10432 states to 10432 states and 34047 transitions. [2022-11-02 20:08:22,417 INFO L78 Accepts]: Start accepts. Automaton has 10432 states and 34047 transitions. Word has length 3 [2022-11-02 20:08:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:22,418 INFO L495 AbstractCegarLoop]: Abstraction has 10432 states and 34047 transitions. [2022-11-02 20:08:22,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 10432 states and 34047 transitions. [2022-11-02 20:08:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:22,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:22,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:22,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:08:22,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2660374, now seen corresponding path program 1 times [2022-11-02 20:08:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:22,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264937341] [2022-11-02 20:08:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:08:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:22,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264937341] [2022-11-02 20:08:22,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264937341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273209095] [2022-11-02 20:08:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:22,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:22,600 INFO L87 Difference]: Start difference. First operand 10432 states and 34047 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:23,071 INFO L93 Difference]: Finished difference Result 9244 states and 30079 transitions. [2022-11-02 20:08:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:23,137 INFO L225 Difference]: With dead ends: 9244 [2022-11-02 20:08:23,137 INFO L226 Difference]: Without dead ends: 9244 [2022-11-02 20:08:23,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:23,141 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:23,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:08:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9244 states. [2022-11-02 20:08:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9244 to 9244. [2022-11-02 20:08:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9244 states, 5885 states have (on average 5.111129991503823) internal successors, (30079), 9243 states have internal predecessors, (30079), 0 states have call successors, (0), 0 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:08:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9244 states to 9244 states and 30079 transitions. [2022-11-02 20:08:23,537 INFO L78 Accepts]: Start accepts. Automaton has 9244 states and 30079 transitions. Word has length 3 [2022-11-02 20:08:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:23,537 INFO L495 AbstractCegarLoop]: Abstraction has 9244 states and 30079 transitions. [2022-11-02 20:08:23,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9244 states and 30079 transitions. [2022-11-02 20:08:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:23,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:23,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:08:23,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2660377, now seen corresponding path program 1 times [2022-11-02 20:08:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:23,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983144215] [2022-11-02 20:08:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:23,875 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:08:23,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:23,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983144215] [2022-11-02 20:08:23,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983144215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:23,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:23,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048069044] [2022-11-02 20:08:23,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:23,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:23,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:23,882 INFO L87 Difference]: Start difference. First operand 9244 states and 30079 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:24,317 INFO L93 Difference]: Finished difference Result 8128 states and 26357 transitions. [2022-11-02 20:08:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:24,374 INFO L225 Difference]: With dead ends: 8128 [2022-11-02 20:08:24,374 INFO L226 Difference]: Without dead ends: 8128 [2022-11-02 20:08:24,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:24,378 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:24,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:08:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8128 states. [2022-11-02 20:08:24,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8128 to 8128. [2022-11-02 20:08:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8128 states, 5217 states have (on average 5.052137243626605) internal successors, (26357), 8127 states have internal predecessors, (26357), 0 states have call successors, (0), 0 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:08:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 26357 transitions. [2022-11-02 20:08:24,889 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 26357 transitions. Word has length 3 [2022-11-02 20:08:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:24,890 INFO L495 AbstractCegarLoop]: Abstraction has 8128 states and 26357 transitions. [2022-11-02 20:08:24,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 26357 transitions. [2022-11-02 20:08:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:24,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:24,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:24,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:08:24,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2660378, now seen corresponding path program 1 times [2022-11-02 20:08:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:24,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990002000] [2022-11-02 20:08:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:25,474 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:08:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:25,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990002000] [2022-11-02 20:08:25,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990002000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:25,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:25,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231375931] [2022-11-02 20:08:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:25,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:25,485 INFO L87 Difference]: Start difference. First operand 8128 states and 26357 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:25,847 INFO L93 Difference]: Finished difference Result 7164 states and 23143 transitions. [2022-11-02 20:08:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:25,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:25,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:25,900 INFO L225 Difference]: With dead ends: 7164 [2022-11-02 20:08:25,901 INFO L226 Difference]: Without dead ends: 7164 [2022-11-02 20:08:25,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:25,902 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:25,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:08:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7164 states. [2022-11-02 20:08:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7164 to 7164. [2022-11-02 20:08:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7164 states, 4645 states have (on average 4.982346609257266) internal successors, (23143), 7163 states have internal predecessors, (23143), 0 states have call successors, (0), 0 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:08:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7164 states to 7164 states and 23143 transitions. [2022-11-02 20:08:26,148 INFO L78 Accepts]: Start accepts. Automaton has 7164 states and 23143 transitions. Word has length 3 [2022-11-02 20:08:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:26,148 INFO L495 AbstractCegarLoop]: Abstraction has 7164 states and 23143 transitions. [2022-11-02 20:08:26,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7164 states and 23143 transitions. [2022-11-02 20:08:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:26,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:26,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:26,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:08:26,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2660379, now seen corresponding path program 1 times [2022-11-02 20:08:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190062112] [2022-11-02 20:08:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:26,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:08:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:26,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190062112] [2022-11-02 20:08:26,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190062112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:26,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:26,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602460434] [2022-11-02 20:08:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:26,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:26,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:26,434 INFO L87 Difference]: Start difference. First operand 7164 states and 23143 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:26,826 INFO L93 Difference]: Finished difference Result 6260 states and 20135 transitions. [2022-11-02 20:08:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:26,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:26,866 INFO L225 Difference]: With dead ends: 6260 [2022-11-02 20:08:26,867 INFO L226 Difference]: Without dead ends: 6260 [2022-11-02 20:08:26,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:26,868 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:26,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:08:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2022-11-02 20:08:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 6260. [2022-11-02 20:08:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6260 states, 4105 states have (on average 4.904993909866017) internal successors, (20135), 6259 states have internal predecessors, (20135), 0 states have call successors, (0), 0 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:08:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 20135 transitions. [2022-11-02 20:08:27,074 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 20135 transitions. Word has length 3 [2022-11-02 20:08:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:27,074 INFO L495 AbstractCegarLoop]: Abstraction has 6260 states and 20135 transitions. [2022-11-02 20:08:27,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 20135 transitions. [2022-11-02 20:08:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:27,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:27,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:27,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:08:27,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2660380, now seen corresponding path program 1 times [2022-11-02 20:08:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:27,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8028543] [2022-11-02 20:08:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:27,206 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:08:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:27,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8028543] [2022-11-02 20:08:27,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8028543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:27,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:27,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810551828] [2022-11-02 20:08:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:27,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:27,210 INFO L87 Difference]: Start difference. First operand 6260 states and 20135 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:27,519 INFO L93 Difference]: Finished difference Result 5396 states and 17273 transitions. [2022-11-02 20:08:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:27,550 INFO L225 Difference]: With dead ends: 5396 [2022-11-02 20:08:27,551 INFO L226 Difference]: Without dead ends: 5396 [2022-11-02 20:08:27,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:27,552 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:27,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:08:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-11-02 20:08:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5396. [2022-11-02 20:08:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5396 states, 3577 states have (on average 4.828906905227845) internal successors, (17273), 5395 states have internal predecessors, (17273), 0 states have call successors, (0), 0 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:08:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 17273 transitions. [2022-11-02 20:08:27,721 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 17273 transitions. Word has length 3 [2022-11-02 20:08:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:27,721 INFO L495 AbstractCegarLoop]: Abstraction has 5396 states and 17273 transitions. [2022-11-02 20:08:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 17273 transitions. [2022-11-02 20:08:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:27,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:27,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:27,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:08:27,723 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2660365, now seen corresponding path program 1 times [2022-11-02 20:08:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:27,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525379584] [2022-11-02 20:08:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:27,863 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:08:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:27,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525379584] [2022-11-02 20:08:27,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525379584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:27,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:27,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818765498] [2022-11-02 20:08:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:27,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:27,868 INFO L87 Difference]: Start difference. First operand 5396 states and 17273 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:28,180 INFO L93 Difference]: Finished difference Result 4596 states and 14629 transitions. [2022-11-02 20:08:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:28,204 INFO L225 Difference]: With dead ends: 4596 [2022-11-02 20:08:28,204 INFO L226 Difference]: Without dead ends: 4596 [2022-11-02 20:08:28,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:28,205 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:28,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:08:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-11-02 20:08:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-11-02 20:08:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3085 states have (on average 4.741977309562398) internal successors, (14629), 4595 states have internal predecessors, (14629), 0 states have call successors, (0), 0 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:08:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 14629 transitions. [2022-11-02 20:08:28,346 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 14629 transitions. Word has length 3 [2022-11-02 20:08:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:28,346 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 14629 transitions. [2022-11-02 20:08:28,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 14629 transitions. [2022-11-02 20:08:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:28,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:28,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:28,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:08:28,348 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2660366, now seen corresponding path program 1 times [2022-11-02 20:08:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:28,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674400060] [2022-11-02 20:08:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:28,564 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:08:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:28,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674400060] [2022-11-02 20:08:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674400060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:28,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865501996] [2022-11-02 20:08:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:28,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:28,567 INFO L87 Difference]: Start difference. First operand 4596 states and 14629 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:28,834 INFO L93 Difference]: Finished difference Result 3916 states and 12385 transitions. [2022-11-02 20:08:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:28,854 INFO L225 Difference]: With dead ends: 3916 [2022-11-02 20:08:28,854 INFO L226 Difference]: Without dead ends: 3916 [2022-11-02 20:08:28,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:28,855 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:28,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-11-02 20:08:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3916. [2022-11-02 20:08:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 2669 states have (on average 4.640314724615961) internal successors, (12385), 3915 states have internal predecessors, (12385), 0 states have call successors, (0), 0 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:08:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 12385 transitions. [2022-11-02 20:08:28,976 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 12385 transitions. Word has length 3 [2022-11-02 20:08:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:28,977 INFO L495 AbstractCegarLoop]: Abstraction has 3916 states and 12385 transitions. [2022-11-02 20:08:28,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 12385 transitions. [2022-11-02 20:08:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:28,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:28,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:28,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:08:28,978 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2660383, now seen corresponding path program 1 times [2022-11-02 20:08:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:28,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045193773] [2022-11-02 20:08:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:29,081 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:08:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045193773] [2022-11-02 20:08:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045193773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:29,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811083508] [2022-11-02 20:08:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:29,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:29,084 INFO L87 Difference]: Start difference. First operand 3916 states and 12385 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:29,335 INFO L93 Difference]: Finished difference Result 3256 states and 10217 transitions. [2022-11-02 20:08:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:29,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:29,350 INFO L225 Difference]: With dead ends: 3256 [2022-11-02 20:08:29,350 INFO L226 Difference]: Without dead ends: 3256 [2022-11-02 20:08:29,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:29,352 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:29,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2022-11-02 20:08:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3256. [2022-11-02 20:08:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3256 states, 2256 states have (on average 4.528812056737588) internal successors, (10217), 3255 states have internal predecessors, (10217), 0 states have call successors, (0), 0 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:08:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 10217 transitions. [2022-11-02 20:08:29,452 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 10217 transitions. Word has length 3 [2022-11-02 20:08:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:29,452 INFO L495 AbstractCegarLoop]: Abstraction has 3256 states and 10217 transitions. [2022-11-02 20:08:29,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 10217 transitions. [2022-11-02 20:08:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:29,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:29,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:29,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:08:29,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2660367, now seen corresponding path program 1 times [2022-11-02 20:08:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:29,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661311417] [2022-11-02 20:08:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08: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:08:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:29,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661311417] [2022-11-02 20:08:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661311417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:29,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:29,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912435257] [2022-11-02 20:08:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:29,652 INFO L87 Difference]: Start difference. First operand 3256 states and 10217 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:29,885 INFO L93 Difference]: Finished difference Result 2700 states and 8395 transitions. [2022-11-02 20:08:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:29,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:29,896 INFO L225 Difference]: With dead ends: 2700 [2022-11-02 20:08:29,896 INFO L226 Difference]: Without dead ends: 2700 [2022-11-02 20:08:29,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:29,897 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:29,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-11-02 20:08:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2022-11-02 20:08:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 1909 states have (on average 4.397590361445783) internal successors, (8395), 2699 states have internal predecessors, (8395), 0 states have call successors, (0), 0 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:08:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8395 transitions. [2022-11-02 20:08:29,966 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8395 transitions. Word has length 3 [2022-11-02 20:08:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:29,966 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 8395 transitions. [2022-11-02 20:08:29,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8395 transitions. [2022-11-02 20:08:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:29,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:29,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:08:29,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2660384, now seen corresponding path program 1 times [2022-11-02 20:08:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610179246] [2022-11-02 20:08:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,206 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:08:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610179246] [2022-11-02 20:08:30,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610179246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:30,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:30,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731601106] [2022-11-02 20:08:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:30,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:30,208 INFO L87 Difference]: Start difference. First operand 2700 states and 8395 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:30,419 INFO L93 Difference]: Finished difference Result 2192 states and 6737 transitions. [2022-11-02 20:08:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:30,426 INFO L225 Difference]: With dead ends: 2192 [2022-11-02 20:08:30,426 INFO L226 Difference]: Without dead ends: 2192 [2022-11-02 20:08:30,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:30,427 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:30,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-11-02 20:08:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2022-11-02 20:08:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 1588 states have (on average 4.242443324937028) internal successors, (6737), 2191 states have internal predecessors, (6737), 0 states have call successors, (0), 0 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:08:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 6737 transitions. [2022-11-02 20:08:30,490 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 6737 transitions. Word has length 3 [2022-11-02 20:08:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:30,490 INFO L495 AbstractCegarLoop]: Abstraction has 2192 states and 6737 transitions. [2022-11-02 20:08:30,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 6737 transitions. [2022-11-02 20:08:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:30,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:30,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:30,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:08:30,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:30,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2660368, now seen corresponding path program 1 times [2022-11-02 20:08:30,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:30,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840577719] [2022-11-02 20:08:30,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:30,572 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:08:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840577719] [2022-11-02 20:08:30,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840577719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:30,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:30,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322727456] [2022-11-02 20:08:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:30,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:30,574 INFO L87 Difference]: Start difference. First operand 2192 states and 6737 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:30,803 INFO L93 Difference]: Finished difference Result 1724 states and 5219 transitions. [2022-11-02 20:08:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:30,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:30,811 INFO L225 Difference]: With dead ends: 1724 [2022-11-02 20:08:30,812 INFO L226 Difference]: Without dead ends: 1724 [2022-11-02 20:08:30,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:30,813 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:30,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2022-11-02 20:08:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2022-11-02 20:08:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1285 states have (on average 4.06147859922179) internal successors, (5219), 1723 states have internal predecessors, (5219), 0 states have call successors, (0), 0 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:08:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 5219 transitions. [2022-11-02 20:08:30,862 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 5219 transitions. Word has length 3 [2022-11-02 20:08:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:30,862 INFO L495 AbstractCegarLoop]: Abstraction has 1724 states and 5219 transitions. [2022-11-02 20:08:30,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 5219 transitions. [2022-11-02 20:08:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:30,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:30,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:30,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:08:30,864 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2660385, now seen corresponding path program 1 times [2022-11-02 20:08:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:30,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100563386] [2022-11-02 20:08:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,053 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:08:31,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:31,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100563386] [2022-11-02 20:08:31,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100563386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:31,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:31,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:31,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709607068] [2022-11-02 20:08:31,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:31,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:31,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:31,055 INFO L87 Difference]: Start difference. First operand 1724 states and 5219 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:31,242 INFO L93 Difference]: Finished difference Result 1324 states and 3927 transitions. [2022-11-02 20:08:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:31,246 INFO L225 Difference]: With dead ends: 1324 [2022-11-02 20:08:31,246 INFO L226 Difference]: Without dead ends: 1324 [2022-11-02 20:08:31,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:31,247 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:31,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-11-02 20:08:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2022-11-02 20:08:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1025 states have (on average 3.831219512195122) internal successors, (3927), 1323 states have internal predecessors, (3927), 0 states have call successors, (0), 0 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:08:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3927 transitions. [2022-11-02 20:08:31,277 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3927 transitions. Word has length 3 [2022-11-02 20:08:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:31,278 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 3927 transitions. [2022-11-02 20:08:31,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3927 transitions. [2022-11-02 20:08:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:31,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:31,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:31,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:08:31,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2660371, now seen corresponding path program 1 times [2022-11-02 20:08:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495945013] [2022-11-02 20:08:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,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:08:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495945013] [2022-11-02 20:08:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495945013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:31,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:31,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417920416] [2022-11-02 20:08:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:31,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:31,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:31,369 INFO L87 Difference]: Start difference. First operand 1324 states and 3927 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:31,529 INFO L93 Difference]: Finished difference Result 964 states and 2773 transitions. [2022-11-02 20:08:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:31,532 INFO L225 Difference]: With dead ends: 964 [2022-11-02 20:08:31,532 INFO L226 Difference]: Without dead ends: 964 [2022-11-02 20:08:31,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:31,533 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:31,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:08:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-11-02 20:08:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2022-11-02 20:08:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 785 states have (on average 3.532484076433121) internal successors, (2773), 963 states have internal predecessors, (2773), 0 states have call successors, (0), 0 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:08:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 2773 transitions. [2022-11-02 20:08:31,556 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 2773 transitions. Word has length 3 [2022-11-02 20:08:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:31,557 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 2773 transitions. [2022-11-02 20:08:31,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 2773 transitions. [2022-11-02 20:08:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:08:31,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:31,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:08:31,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:08:31,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:31,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2660372, now seen corresponding path program 1 times [2022-11-02 20:08:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:31,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509392602] [2022-11-02 20:08:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:31,771 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:08:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509392602] [2022-11-02 20:08:31,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509392602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:31,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:31,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306722038] [2022-11-02 20:08:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:31,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:31,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:31,777 INFO L87 Difference]: Start difference. First operand 964 states and 2773 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:31,924 INFO L93 Difference]: Finished difference Result 660 states and 1805 transitions. [2022-11-02 20:08:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-02 20:08:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:31,927 INFO L225 Difference]: With dead ends: 660 [2022-11-02 20:08:31,927 INFO L226 Difference]: Without dead ends: 658 [2022-11-02 20:08:31,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:31,935 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:31,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-02 20:08:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-11-02 20:08:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 578 states have (on average 3.114186851211073) internal successors, (1800), 657 states have internal predecessors, (1800), 0 states have call successors, (0), 0 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:08:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1800 transitions. [2022-11-02 20:08:31,958 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1800 transitions. Word has length 3 [2022-11-02 20:08:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:31,958 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1800 transitions. [2022-11-02 20:08:31,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:08:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1800 transitions. [2022-11-02 20:08:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:31,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:31,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:31,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:08:31,960 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116839, now seen corresponding path program 1 times [2022-11-02 20:08:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:31,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693118401] [2022-11-02 20:08:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,016 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:08:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:32,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693118401] [2022-11-02 20:08:32,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693118401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:32,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:32,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778180622] [2022-11-02 20:08:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:32,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:32,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:32,018 INFO L87 Difference]: Start difference. First operand 658 states and 1800 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:32,157 INFO L93 Difference]: Finished difference Result 538 states and 1456 transitions. [2022-11-02 20:08:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:32,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:32,160 INFO L225 Difference]: With dead ends: 538 [2022-11-02 20:08:32,160 INFO L226 Difference]: Without dead ends: 538 [2022-11-02 20:08:32,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:32,161 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:32,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-02 20:08:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-11-02 20:08:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 475 states have (on average 3.0652631578947367) internal successors, (1456), 537 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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:08:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1456 transitions. [2022-11-02 20:08:32,173 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1456 transitions. Word has length 5 [2022-11-02 20:08:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:32,174 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1456 transitions. [2022-11-02 20:08:32,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1456 transitions. [2022-11-02 20:08:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:32,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:32,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:32,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:08:32,175 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116821, now seen corresponding path program 1 times [2022-11-02 20:08:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:32,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834523605] [2022-11-02 20:08:32,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,517 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:08:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:32,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834523605] [2022-11-02 20:08:32,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834523605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:32,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:32,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572382973] [2022-11-02 20:08:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:32,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:32,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:32,520 INFO L87 Difference]: Start difference. First operand 538 states and 1456 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:32,645 INFO L93 Difference]: Finished difference Result 430 states and 1148 transitions. [2022-11-02 20:08:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:32,647 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:08:32,648 INFO L226 Difference]: Without dead ends: 430 [2022-11-02 20:08:32,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:32,648 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:32,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-02 20:08:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-11-02 20:08:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 382 states have (on average 3.005235602094241) internal successors, (1148), 429 states have internal predecessors, (1148), 0 states have call successors, (0), 0 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:08:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1148 transitions. [2022-11-02 20:08:32,660 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1148 transitions. Word has length 5 [2022-11-02 20:08:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:32,661 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 1148 transitions. [2022-11-02 20:08:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1148 transitions. [2022-11-02 20:08:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:32,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:32,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:32,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:08:32,662 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116836, now seen corresponding path program 1 times [2022-11-02 20:08:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:32,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495951192] [2022-11-02 20:08:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:32,729 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:08:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:32,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495951192] [2022-11-02 20:08:32,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495951192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:32,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:32,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:32,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478771518] [2022-11-02 20:08:32,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:32,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:32,731 INFO L87 Difference]: Start difference. First operand 430 states and 1148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:32,837 INFO L93 Difference]: Finished difference Result 334 states and 876 transitions. [2022-11-02 20:08:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:32,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:32,839 INFO L225 Difference]: With dead ends: 334 [2022-11-02 20:08:32,840 INFO L226 Difference]: Without dead ends: 334 [2022-11-02 20:08:32,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:32,840 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:32,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-02 20:08:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-02 20:08:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 2.9297658862876252) internal successors, (876), 333 states have internal predecessors, (876), 0 states have call successors, (0), 0 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:08:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 876 transitions. [2022-11-02 20:08:32,849 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 876 transitions. Word has length 5 [2022-11-02 20:08:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:32,850 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 876 transitions. [2022-11-02 20:08:32,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 876 transitions. [2022-11-02 20:08:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:32,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:32,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:32,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:08:32,851 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116818, now seen corresponding path program 1 times [2022-11-02 20:08:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:32,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747171590] [2022-11-02 20:08:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:33,241 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:08:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:33,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747171590] [2022-11-02 20:08:33,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747171590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:33,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:33,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652547921] [2022-11-02 20:08:33,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:33,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:33,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:33,244 INFO L87 Difference]: Start difference. First operand 334 states and 876 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:33,346 INFO L93 Difference]: Finished difference Result 250 states and 640 transitions. [2022-11-02 20:08:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:33,348 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:08:33,348 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 20:08:33,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:33,349 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:33,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 20:08:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-02 20:08:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 226 states have (on average 2.831858407079646) internal successors, (640), 249 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:08:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 640 transitions. [2022-11-02 20:08:33,356 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 640 transitions. Word has length 5 [2022-11-02 20:08:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:33,357 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 640 transitions. [2022-11-02 20:08:33,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 640 transitions. [2022-11-02 20:08:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:33,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:33,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:33,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:08:33,358 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116833, now seen corresponding path program 1 times [2022-11-02 20:08:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:33,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460778070] [2022-11-02 20:08:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:33,428 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:08:33,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:33,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460778070] [2022-11-02 20:08:33,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460778070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:33,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:33,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272323640] [2022-11-02 20:08:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:33,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:33,431 INFO L87 Difference]: Start difference. First operand 250 states and 640 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:33,521 INFO L93 Difference]: Finished difference Result 178 states and 440 transitions. [2022-11-02 20:08:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:33,523 INFO L225 Difference]: With dead ends: 178 [2022-11-02 20:08:33,523 INFO L226 Difference]: Without dead ends: 178 [2022-11-02 20:08:33,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:33,524 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:33,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-02 20:08:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-11-02 20:08:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 163 states have (on average 2.6993865030674846) internal successors, (440), 177 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:08:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 440 transitions. [2022-11-02 20:08:33,529 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 440 transitions. Word has length 5 [2022-11-02 20:08:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:33,529 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 440 transitions. [2022-11-02 20:08:33,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 440 transitions. [2022-11-02 20:08:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:33,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:33,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:33,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:08:33,531 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116830, now seen corresponding path program 1 times [2022-11-02 20:08:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:33,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107041858] [2022-11-02 20:08:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:33,628 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:08:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:33,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107041858] [2022-11-02 20:08:33,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107041858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:33,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:33,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419520299] [2022-11-02 20:08:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:33,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:33,630 INFO L87 Difference]: Start difference. First operand 178 states and 440 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:33,704 INFO L93 Difference]: Finished difference Result 118 states and 276 transitions. [2022-11-02 20:08:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:33,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:33,706 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:08:33,706 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:08:33,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:33,707 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:33,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:08:33,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-02 20:08:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 117 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:08:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 276 transitions. [2022-11-02 20:08:33,711 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 276 transitions. Word has length 5 [2022-11-02 20:08:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:33,711 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 276 transitions. [2022-11-02 20:08:33,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 276 transitions. [2022-11-02 20:08:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:33,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:33,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:33,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:08:33,712 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:33,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116827, now seen corresponding path program 1 times [2022-11-02 20:08:33,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:33,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961910513] [2022-11-02 20:08:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:33,790 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:08:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961910513] [2022-11-02 20:08:33,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961910513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:33,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:33,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139960339] [2022-11-02 20:08:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:33,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:33,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:33,793 INFO L87 Difference]: Start difference. First operand 118 states and 276 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:33,859 INFO L93 Difference]: Finished difference Result 70 states and 148 transitions. [2022-11-02 20:08:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:33,861 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:08:33,861 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:08:33,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:33,861 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:33,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:08:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:08:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 20:08:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 2.208955223880597) internal successors, (148), 69 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:08:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 148 transitions. [2022-11-02 20:08:33,864 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 148 transitions. Word has length 5 [2022-11-02 20:08:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:33,864 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 148 transitions. [2022-11-02 20:08:33,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 148 transitions. [2022-11-02 20:08:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:08:33,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:08:33,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:08:33,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:08:33,865 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-02 20:08:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:08:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116824, now seen corresponding path program 1 times [2022-11-02 20:08:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:08:33,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692698246] [2022-11-02 20:08:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:08:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:08:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:08:34,043 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:08:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:08:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692698246] [2022-11-02 20:08:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692698246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:08:34,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:08:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:08:34,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265932195] [2022-11-02 20:08:34,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:08:34,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:08:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:08:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:08:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:08:34,049 INFO L87 Difference]: Start difference. First operand 70 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:08:34,098 INFO L93 Difference]: Finished difference Result 34 states and 56 transitions. [2022-11-02 20:08:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:08:34,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:08:34,099 INFO L225 Difference]: With dead ends: 34 [2022-11-02 20:08:34,099 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:08:34,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:08:34,101 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:08:34,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:08:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:08:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:08:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:08:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:08:34,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2022-11-02 20:08:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:08:34,103 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:08:34,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:08:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:08:34,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:08:34,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 147 remaining) [2022-11-02 20:08:34,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 147 remaining) [2022-11-02 20:08:34,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 147 remaining) [2022-11-02 20:08:34,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 147 remaining) [2022-11-02 20:08:34,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 147 remaining) [2022-11-02 20:08:34,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 147 remaining) [2022-11-02 20:08:34,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 147 remaining) [2022-11-02 20:08:34,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 147 remaining) [2022-11-02 20:08:34,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 147 remaining) [2022-11-02 20:08:34,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 147 remaining) [2022-11-02 20:08:34,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 147 remaining) [2022-11-02 20:08:34,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 147 remaining) [2022-11-02 20:08:34,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 147 remaining) [2022-11-02 20:08:34,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 147 remaining) [2022-11-02 20:08:34,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 147 remaining) [2022-11-02 20:08:34,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 147 remaining) [2022-11-02 20:08:34,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 147 remaining) [2022-11-02 20:08:34,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 147 remaining) [2022-11-02 20:08:34,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 147 remaining) [2022-11-02 20:08:34,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 147 remaining) [2022-11-02 20:08:34,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 147 remaining) [2022-11-02 20:08:34,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 147 remaining) [2022-11-02 20:08:34,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 147 remaining) [2022-11-02 20:08:34,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 147 remaining) [2022-11-02 20:08:34,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 147 remaining) [2022-11-02 20:08:34,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 147 remaining) [2022-11-02 20:08:34,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 147 remaining) [2022-11-02 20:08:34,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 147 remaining) [2022-11-02 20:08:34,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 147 remaining) [2022-11-02 20:08:34,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 147 remaining) [2022-11-02 20:08:34,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 147 remaining) [2022-11-02 20:08:34,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 147 remaining) [2022-11-02 20:08:34,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 147 remaining) [2022-11-02 20:08:34,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 147 remaining) [2022-11-02 20:08:34,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 147 remaining) [2022-11-02 20:08:34,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 147 remaining) [2022-11-02 20:08:34,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 147 remaining) [2022-11-02 20:08:34,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 147 remaining) [2022-11-02 20:08:34,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 147 remaining) [2022-11-02 20:08:34,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 147 remaining) [2022-11-02 20:08:34,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 147 remaining) [2022-11-02 20:08:34,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 147 remaining) [2022-11-02 20:08:34,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 147 remaining) [2022-11-02 20:08:34,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 147 remaining) [2022-11-02 20:08:34,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 147 remaining) [2022-11-02 20:08:34,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 147 remaining) [2022-11-02 20:08:34,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 147 remaining) [2022-11-02 20:08:34,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 147 remaining) [2022-11-02 20:08:34,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 147 remaining) [2022-11-02 20:08:34,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 147 remaining) [2022-11-02 20:08:34,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 147 remaining) [2022-11-02 20:08:34,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 147 remaining) [2022-11-02 20:08:34,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 147 remaining) [2022-11-02 20:08:34,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 147 remaining) [2022-11-02 20:08:34,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 147 remaining) [2022-11-02 20:08:34,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 147 remaining) [2022-11-02 20:08:34,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 147 remaining) [2022-11-02 20:08:34,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 147 remaining) [2022-11-02 20:08:34,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 147 remaining) [2022-11-02 20:08:34,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 147 remaining) [2022-11-02 20:08:34,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 147 remaining) [2022-11-02 20:08:34,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 147 remaining) [2022-11-02 20:08:34,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 147 remaining) [2022-11-02 20:08:34,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 147 remaining) [2022-11-02 20:08:34,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 147 remaining) [2022-11-02 20:08:34,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 147 remaining) [2022-11-02 20:08:34,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 147 remaining) [2022-11-02 20:08:34,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 147 remaining) [2022-11-02 20:08:34,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 147 remaining) [2022-11-02 20:08:34,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 147 remaining) [2022-11-02 20:08:34,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 147 remaining) [2022-11-02 20:08:34,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 147 remaining) [2022-11-02 20:08:34,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 147 remaining) [2022-11-02 20:08:34,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 147 remaining) [2022-11-02 20:08:34,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 147 remaining) [2022-11-02 20:08:34,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 147 remaining) [2022-11-02 20:08:34,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 147 remaining) [2022-11-02 20:08:34,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 147 remaining) [2022-11-02 20:08:34,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 147 remaining) [2022-11-02 20:08:34,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 147 remaining) [2022-11-02 20:08:34,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 147 remaining) [2022-11-02 20:08:34,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 147 remaining) [2022-11-02 20:08:34,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 147 remaining) [2022-11-02 20:08:34,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 147 remaining) [2022-11-02 20:08:34,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 147 remaining) [2022-11-02 20:08:34,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 147 remaining) [2022-11-02 20:08:34,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 147 remaining) [2022-11-02 20:08:34,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 147 remaining) [2022-11-02 20:08:34,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 147 remaining) [2022-11-02 20:08:34,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 147 remaining) [2022-11-02 20:08:34,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 147 remaining) [2022-11-02 20:08:34,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 147 remaining) [2022-11-02 20:08:34,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 147 remaining) [2022-11-02 20:08:34,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 147 remaining) [2022-11-02 20:08:34,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 147 remaining) [2022-11-02 20:08:34,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 147 remaining) [2022-11-02 20:08:34,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 147 remaining) [2022-11-02 20:08:34,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 147 remaining) [2022-11-02 20:08:34,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 147 remaining) [2022-11-02 20:08:34,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 147 remaining) [2022-11-02 20:08:34,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 147 remaining) [2022-11-02 20:08:34,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 147 remaining) [2022-11-02 20:08:34,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 147 remaining) [2022-11-02 20:08:34,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 147 remaining) [2022-11-02 20:08:34,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 147 remaining) [2022-11-02 20:08:34,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 147 remaining) [2022-11-02 20:08:34,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 147 remaining) [2022-11-02 20:08:34,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 147 remaining) [2022-11-02 20:08:34,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 147 remaining) [2022-11-02 20:08:34,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 147 remaining) [2022-11-02 20:08:34,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 147 remaining) [2022-11-02 20:08:34,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 147 remaining) [2022-11-02 20:08:34,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 147 remaining) [2022-11-02 20:08:34,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 147 remaining) [2022-11-02 20:08:34,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 147 remaining) [2022-11-02 20:08:34,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 147 remaining) [2022-11-02 20:08:34,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 147 remaining) [2022-11-02 20:08:34,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 147 remaining) [2022-11-02 20:08:34,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 147 remaining) [2022-11-02 20:08:34,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 147 remaining) [2022-11-02 20:08:34,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 147 remaining) [2022-11-02 20:08:34,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 147 remaining) [2022-11-02 20:08:34,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 147 remaining) [2022-11-02 20:08:34,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 147 remaining) [2022-11-02 20:08:34,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 147 remaining) [2022-11-02 20:08:34,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 147 remaining) [2022-11-02 20:08:34,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 147 remaining) [2022-11-02 20:08:34,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 147 remaining) [2022-11-02 20:08:34,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 147 remaining) [2022-11-02 20:08:34,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 147 remaining) [2022-11-02 20:08:34,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 147 remaining) [2022-11-02 20:08:34,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 147 remaining) [2022-11-02 20:08:34,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 147 remaining) [2022-11-02 20:08:34,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 147 remaining) [2022-11-02 20:08:34,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 147 remaining) [2022-11-02 20:08:34,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 147 remaining) [2022-11-02 20:08:34,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 147 remaining) [2022-11-02 20:08:34,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 147 remaining) [2022-11-02 20:08:34,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 147 remaining) [2022-11-02 20:08:34,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 147 remaining) [2022-11-02 20:08:34,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:08:34,149 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:08:34,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:08:34,172 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:08:34,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:08:34 BasicIcfg [2022-11-02 20:08:34,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:08:34,178 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:08:34,178 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:08:34,179 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:08:34,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:06:58" (3/4) ... [2022-11-02 20:08:34,183 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:08:34,189 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:08:34,189 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:08:34,189 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:08:34,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-02 20:08:34,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:08:34,198 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:08:34,198 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:08:34,253 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:08:34,253 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:08:34,254 INFO L158 Benchmark]: Toolchain (without parser) took 105086.65ms. Allocated memory was 100.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 62.3MB in the beginning and 577.0MB in the end (delta: -514.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-02 20:08:34,254 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 100.7MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:08:34,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.21ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 75.9MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:08:34,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.34ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 72.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:08:34,255 INFO L158 Benchmark]: Boogie Preprocessor took 53.02ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 70.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:08:34,255 INFO L158 Benchmark]: RCFGBuilder took 8354.95ms. Allocated memory was 100.7MB in the beginning and 729.8MB in the end (delta: 629.1MB). Free memory was 70.0MB in the beginning and 646.7MB in the end (delta: -576.7MB). Peak memory consumption was 253.4MB. Max. memory is 16.1GB. [2022-11-02 20:08:34,258 INFO L158 Benchmark]: TraceAbstraction took 96158.36ms. Allocated memory was 729.8MB in the beginning and 1.7GB in the end (delta: 943.7MB). Free memory was 646.7MB in the beginning and 580.2MB in the end (delta: 66.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-02 20:08:34,259 INFO L158 Benchmark]: Witness Printer took 74.78ms. Allocated memory is still 1.7GB. Free memory was 580.2MB in the beginning and 577.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:08:34,269 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 100.7MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.21ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 75.9MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.34ms. Allocated memory is still 100.7MB. Free memory was 75.9MB in the beginning and 72.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.02ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 70.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8354.95ms. Allocated memory was 100.7MB in the beginning and 729.8MB in the end (delta: 629.1MB). Free memory was 70.0MB in the beginning and 646.7MB in the end (delta: -576.7MB). Peak memory consumption was 253.4MB. Max. memory is 16.1GB. * TraceAbstraction took 96158.36ms. Allocated memory was 729.8MB in the beginning and 1.7GB in the end (delta: 943.7MB). Free memory was 646.7MB in the beginning and 580.2MB in the end (delta: 66.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 74.78ms. Allocated memory is still 1.7GB. Free memory was 580.2MB in the beginning and 577.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.2s, 205 PlacesBefore, 101 PlacesAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 6318 CoEnabledTransitionPairs, 8 FixpointIterations, 85 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 4799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4799, positive: 4799, positive conditional: 0, positive unconditional: 4799, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1365, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1365, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4799, positive: 3434, positive conditional: 0, positive unconditional: 3434, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1365, unknown conditional: 0, unknown unconditional: 1365] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 283 locations, 147 error locations. Started 1 CEGAR loops. OverallTime: 94.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 78.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 0 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37956occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:08:34,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab4c2cd5-416a-4a11-921c-a23810eea929/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE