/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 01:42:56,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 01:42:56,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 01:42:56,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 01:42:56,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 01:42:56,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 01:42:56,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 01:42:56,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 01:42:56,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 01:42:56,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 01:42:56,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 01:42:56,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 01:42:56,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 01:42:56,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 01:42:56,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 01:42:56,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 01:42:56,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 01:42:56,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 01:42:56,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 01:42:56,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 01:42:56,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 01:42:56,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 01:42:56,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 01:42:56,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 01:42:56,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 01:42:56,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 01:42:56,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 01:42:56,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 01:42:56,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 01:42:56,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 01:42:56,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 01:42:56,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 01:42:56,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 01:42:56,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 01:42:56,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 01:42:56,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 01:42:56,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 01:42:56,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 01:42:56,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 01:42:56,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 01:42:56,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 01:42:56,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-18 01:42:56,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 01:42:56,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 01:42:56,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 01:42:56,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 01:42:56,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 01:42:56,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 01:42:56,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 01:42:56,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 01:42:56,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 01:42:56,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 01:42:56,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 01:42:56,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 01:42:56,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 01:42:56,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 01:42:56,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 01:42:56,649 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 01:42:56,649 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 01:42:56,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-01-18 01:42:56,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a908aefe7/907cff7770a94de890fe38458def4b5b/FLAG4baedcf35 [2022-01-18 01:42:57,058 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 01:42:57,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-01-18 01:42:57,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a908aefe7/907cff7770a94de890fe38458def4b5b/FLAG4baedcf35 [2022-01-18 01:42:57,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a908aefe7/907cff7770a94de890fe38458def4b5b [2022-01-18 01:42:57,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 01:42:57,083 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 01:42:57,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 01:42:57,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 01:42:57,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 01:42:57,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db8a560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57, skipping insertion in model container [2022-01-18 01:42:57,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 01:42:57,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 01:42:57,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2022-01-18 01:42:57,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 01:42:57,282 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 01:42:57,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c[2865,2878] [2022-01-18 01:42:57,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 01:42:57,311 INFO L208 MainTranslator]: Completed translation [2022-01-18 01:42:57,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57 WrapperNode [2022-01-18 01:42:57,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 01:42:57,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 01:42:57,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 01:42:57,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 01:42:57,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,339 INFO L137 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 275 [2022-01-18 01:42:57,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 01:42:57,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 01:42:57,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 01:42:57,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 01:42:57,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 01:42:57,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 01:42:57,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 01:42:57,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 01:42:57,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (1/1) ... [2022-01-18 01:42:57,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 01:42:57,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:42:57,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 01:42:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 01:42:57,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 01:42:57,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 01:42:57,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 01:42:57,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-18 01:42:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-18 01:42:57,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-18 01:42:57,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-18 01:42:57,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-18 01:42:57,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-18 01:42:57,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-18 01:42:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 01:42:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 01:42:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 01:42:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-18 01:42:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 01:42:57,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 01:42:57,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 01:42:57,459 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 01:42:57,522 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 01:42:57,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 01:42:57,811 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 01:42:57,920 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 01:42:57,920 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-18 01:42:57,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 01:42:57 BoogieIcfgContainer [2022-01-18 01:42:57,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 01:42:57,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 01:42:57,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 01:42:57,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 01:42:57,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 01:42:57" (1/3) ... [2022-01-18 01:42:57,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c467bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 01:42:57, skipping insertion in model container [2022-01-18 01:42:57,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 01:42:57" (2/3) ... [2022-01-18 01:42:57,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c467bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 01:42:57, skipping insertion in model container [2022-01-18 01:42:57,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 01:42:57" (3/3) ... [2022-01-18 01:42:57,927 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2022-01-18 01:42:57,930 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 01:42:57,930 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 01:42:57,931 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-18 01:42:57,931 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 01:42:57,994 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,994 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,994 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,994 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:57,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,005 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,006 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,007 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,008 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,009 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,010 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,013 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,014 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,015 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,016 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,030 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,030 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,030 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,030 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,030 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,030 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,031 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~j~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~j~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,038 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,039 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,040 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,042 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 01:42:58,047 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-18 01:42:58,097 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 01:42:58,102 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 01:42:58,102 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-18 01:42:58,120 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 242 places, 257 transitions, 538 flow [2022-01-18 01:43:00,489 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76744 states, 76743 states have (on average 4.128689261561315) internal successors, (316848), 76743 states have internal predecessors, (316848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 76744 states, 76743 states have (on average 4.128689261561315) internal successors, (316848), 76743 states have internal predecessors, (316848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-18 01:43:01,094 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:01,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:01,096 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 258024802, now seen corresponding path program 1 times [2022-01-18 01:43:01,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:01,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752811406] [2022-01-18 01:43:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:01,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 01:43:01,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752811406] [2022-01-18 01:43:01,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752811406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:01,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:01,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 01:43:01,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502820920] [2022-01-18 01:43:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:01,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-18 01:43:01,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:01,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-18 01:43:01,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 01:43:01,410 INFO L87 Difference]: Start difference. First operand has 76744 states, 76743 states have (on average 4.128689261561315) internal successors, (316848), 76743 states have internal predecessors, (316848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:02,628 INFO L93 Difference]: Finished difference Result 76744 states and 291073 transitions. [2022-01-18 01:43:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-18 01:43:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2022-01-18 01:43:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:03,122 INFO L225 Difference]: With dead ends: 76744 [2022-01-18 01:43:03,122 INFO L226 Difference]: Without dead ends: 68466 [2022-01-18 01:43:03,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-18 01:43:03,126 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:03,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 01:43:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68466 states. [2022-01-18 01:43:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68466 to 68466. [2022-01-18 01:43:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68466 states, 68465 states have (on average 3.794303658803768) internal successors, (259777), 68465 states have internal predecessors, (259777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68466 states to 68466 states and 259777 transitions. [2022-01-18 01:43:06,156 INFO L78 Accepts]: Start accepts. Automaton has 68466 states and 259777 transitions. Word has length 137 [2022-01-18 01:43:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:06,157 INFO L470 AbstractCegarLoop]: Abstraction has 68466 states and 259777 transitions. [2022-01-18 01:43:06,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 68466 states and 259777 transitions. [2022-01-18 01:43:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-18 01:43:06,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:06,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:06,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 01:43:06,283 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -171729596, now seen corresponding path program 1 times [2022-01-18 01:43:06,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:06,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679877146] [2022-01-18 01:43:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:06,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 01:43:06,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:06,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679877146] [2022-01-18 01:43:06,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679877146] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:06,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:06,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 01:43:06,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005259070] [2022-01-18 01:43:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:06,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 01:43:06,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:06,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 01:43:06,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-18 01:43:06,579 INFO L87 Difference]: Start difference. First operand 68466 states and 259777 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:07,427 INFO L93 Difference]: Finished difference Result 71044 states and 269586 transitions. [2022-01-18 01:43:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 01:43:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2022-01-18 01:43:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:07,702 INFO L225 Difference]: With dead ends: 71044 [2022-01-18 01:43:07,702 INFO L226 Difference]: Without dead ends: 71044 [2022-01-18 01:43:07,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-18 01:43:07,703 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 232 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:07,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 691 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 01:43:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71044 states. [2022-01-18 01:43:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71044 to 71044. [2022-01-18 01:43:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71044 states, 71043 states have (on average 3.7946877243359656) internal successors, (269586), 71043 states have internal predecessors, (269586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71044 states to 71044 states and 269586 transitions. [2022-01-18 01:43:10,251 INFO L78 Accepts]: Start accepts. Automaton has 71044 states and 269586 transitions. Word has length 137 [2022-01-18 01:43:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:10,253 INFO L470 AbstractCegarLoop]: Abstraction has 71044 states and 269586 transitions. [2022-01-18 01:43:10,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 71044 states and 269586 transitions. [2022-01-18 01:43:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-18 01:43:10,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:10,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:10,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 01:43:10,421 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash -21740498, now seen corresponding path program 1 times [2022-01-18 01:43:10,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:10,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961341341] [2022-01-18 01:43:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:10,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 01:43:10,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:10,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961341341] [2022-01-18 01:43:10,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961341341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:10,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:10,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 01:43:10,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318013161] [2022-01-18 01:43:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:10,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 01:43:10,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 01:43:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-18 01:43:10,979 INFO L87 Difference]: Start difference. First operand 71044 states and 269586 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:11,625 INFO L93 Difference]: Finished difference Result 71093 states and 269636 transitions. [2022-01-18 01:43:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 01:43:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-01-18 01:43:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:11,948 INFO L225 Difference]: With dead ends: 71093 [2022-01-18 01:43:11,948 INFO L226 Difference]: Without dead ends: 71050 [2022-01-18 01:43:11,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-01-18 01:43:11,949 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 260 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:11,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 967 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 01:43:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71050 states. [2022-01-18 01:43:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71050 to 71045. [2022-01-18 01:43:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71045 states, 71044 states have (on average 3.794648386915151) internal successors, (269587), 71044 states have internal predecessors, (269587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71045 states to 71045 states and 269587 transitions. [2022-01-18 01:43:14,385 INFO L78 Accepts]: Start accepts. Automaton has 71045 states and 269587 transitions. Word has length 153 [2022-01-18 01:43:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:14,385 INFO L470 AbstractCegarLoop]: Abstraction has 71045 states and 269587 transitions. [2022-01-18 01:43:14,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71045 states and 269587 transitions. [2022-01-18 01:43:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-18 01:43:14,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:14,569 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:14,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 01:43:14,569 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -279770929, now seen corresponding path program 1 times [2022-01-18 01:43:14,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:14,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397752997] [2022-01-18 01:43:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:14,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 01:43:14,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:14,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397752997] [2022-01-18 01:43:14,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397752997] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 01:43:14,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797099021] [2022-01-18 01:43:14,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:14,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:43:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:43:14,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 01:43:14,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-18 01:43:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:14,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-18 01:43:14,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 01:43:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 01:43:15,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 01:43:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-18 01:43:15,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797099021] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-18 01:43:15,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-18 01:43:15,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-18 01:43:15,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749819081] [2022-01-18 01:43:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:15,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 01:43:15,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 01:43:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-18 01:43:15,829 INFO L87 Difference]: Start difference. First operand 71045 states and 269587 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:16,389 INFO L93 Difference]: Finished difference Result 73801 states and 280009 transitions. [2022-01-18 01:43:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 01:43:16,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-18 01:43:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:16,672 INFO L225 Difference]: With dead ends: 73801 [2022-01-18 01:43:16,672 INFO L226 Difference]: Without dead ends: 73801 [2022-01-18 01:43:16,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 312 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-18 01:43:16,673 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 719 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:16,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [719 Valid, 538 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-18 01:43:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73801 states. [2022-01-18 01:43:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73801 to 73801. [2022-01-18 01:43:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73801 states, 73800 states have (on average 3.794159891598916) internal successors, (280009), 73800 states have internal predecessors, (280009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73801 states to 73801 states and 280009 transitions. [2022-01-18 01:43:19,079 INFO L78 Accepts]: Start accepts. Automaton has 73801 states and 280009 transitions. Word has length 160 [2022-01-18 01:43:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:19,080 INFO L470 AbstractCegarLoop]: Abstraction has 73801 states and 280009 transitions. [2022-01-18 01:43:19,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 73801 states and 280009 transitions. [2022-01-18 01:43:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-18 01:43:19,265 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:19,266 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:19,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-18 01:43:19,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:43:19,483 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:19,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1351331201, now seen corresponding path program 1 times [2022-01-18 01:43:19,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:19,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140575080] [2022-01-18 01:43:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:19,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-18 01:43:19,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140575080] [2022-01-18 01:43:19,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140575080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:19,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:19,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 01:43:19,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313617894] [2022-01-18 01:43:19,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:19,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 01:43:19,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 01:43:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 01:43:19,563 INFO L87 Difference]: Start difference. First operand 73801 states and 280009 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:21,875 INFO L93 Difference]: Finished difference Result 184567 states and 701610 transitions. [2022-01-18 01:43:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 01:43:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2022-01-18 01:43:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:22,748 INFO L225 Difference]: With dead ends: 184567 [2022-01-18 01:43:22,749 INFO L226 Difference]: Without dead ends: 184417 [2022-01-18 01:43:22,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-18 01:43:22,749 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 322 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:22,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 856 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 01:43:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184417 states. [2022-01-18 01:43:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184417 to 112782. [2022-01-18 01:43:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112782 states, 112781 states have (on average 3.8007554463961126) internal successors, (428653), 112781 states have internal predecessors, (428653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112782 states to 112782 states and 428653 transitions. [2022-01-18 01:43:27,742 INFO L78 Accepts]: Start accepts. Automaton has 112782 states and 428653 transitions. Word has length 176 [2022-01-18 01:43:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:27,743 INFO L470 AbstractCegarLoop]: Abstraction has 112782 states and 428653 transitions. [2022-01-18 01:43:27,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 112782 states and 428653 transitions. [2022-01-18 01:43:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 01:43:28,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:28,068 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:28,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 01:43:28,068 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 293597412, now seen corresponding path program 1 times [2022-01-18 01:43:28,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:28,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774916604] [2022-01-18 01:43:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:28,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:43:28,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:28,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774916604] [2022-01-18 01:43:28,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774916604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:28,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:28,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-18 01:43:28,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020992757] [2022-01-18 01:43:28,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:28,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-18 01:43:28,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-18 01:43:28,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-18 01:43:28,212 INFO L87 Difference]: Start difference. First operand 112782 states and 428653 transitions. Second operand has 12 states, 12 states have (on average 15.25) internal successors, (183), 12 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:31,002 INFO L93 Difference]: Finished difference Result 211935 states and 801287 transitions. [2022-01-18 01:43:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 01:43:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.25) internal successors, (183), 12 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2022-01-18 01:43:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:31,970 INFO L225 Difference]: With dead ends: 211935 [2022-01-18 01:43:31,971 INFO L226 Difference]: Without dead ends: 211065 [2022-01-18 01:43:31,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-01-18 01:43:31,971 INFO L933 BasicCegarLoop]: 480 mSDtfsCounter, 1112 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:31,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1112 Valid, 2288 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-18 01:43:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211065 states. [2022-01-18 01:43:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211065 to 197758. [2022-01-18 01:43:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197758 states, 197757 states have (on average 3.802530378191417) internal successors, (751977), 197757 states have internal predecessors, (751977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197758 states to 197758 states and 751977 transitions. [2022-01-18 01:43:39,484 INFO L78 Accepts]: Start accepts. Automaton has 197758 states and 751977 transitions. Word has length 183 [2022-01-18 01:43:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:39,484 INFO L470 AbstractCegarLoop]: Abstraction has 197758 states and 751977 transitions. [2022-01-18 01:43:39,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.25) internal successors, (183), 12 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 197758 states and 751977 transitions. [2022-01-18 01:43:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 01:43:40,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:40,065 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:40,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 01:43:40,067 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:40,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash -645814564, now seen corresponding path program 1 times [2022-01-18 01:43:40,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:40,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117725568] [2022-01-18 01:43:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:40,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:43:40,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:40,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117725568] [2022-01-18 01:43:40,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117725568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:40,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:40,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-18 01:43:40,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137608740] [2022-01-18 01:43:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:40,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-18 01:43:40,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-18 01:43:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-01-18 01:43:40,364 INFO L87 Difference]: Start difference. First operand 197758 states and 751977 transitions. Second operand has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:43,850 INFO L93 Difference]: Finished difference Result 266492 states and 1008754 transitions. [2022-01-18 01:43:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 01:43:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2022-01-18 01:43:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:45,042 INFO L225 Difference]: With dead ends: 266492 [2022-01-18 01:43:45,042 INFO L226 Difference]: Without dead ends: 260882 [2022-01-18 01:43:45,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-01-18 01:43:45,043 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 2140 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:45,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2140 Valid, 3478 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-18 01:43:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260882 states. [2022-01-18 01:43:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260882 to 241289. [2022-01-18 01:43:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241289 states, 241288 states have (on average 3.7905697755379464) internal successors, (914619), 241288 states have internal predecessors, (914619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241289 states to 241289 states and 914619 transitions. [2022-01-18 01:43:54,375 INFO L78 Accepts]: Start accepts. Automaton has 241289 states and 914619 transitions. Word has length 183 [2022-01-18 01:43:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:43:54,375 INFO L470 AbstractCegarLoop]: Abstraction has 241289 states and 914619 transitions. [2022-01-18 01:43:54,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.631578947368421) internal successors, (183), 19 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 241289 states and 914619 transitions. [2022-01-18 01:43:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-18 01:43:55,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:43:55,071 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:43:55,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 01:43:55,072 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:43:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:43:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -934923376, now seen corresponding path program 2 times [2022-01-18 01:43:55,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:43:55,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210290510] [2022-01-18 01:43:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:43:55,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:43:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:43:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:43:55,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:43:55,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210290510] [2022-01-18 01:43:55,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210290510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 01:43:55,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 01:43:55,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-18 01:43:55,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786492397] [2022-01-18 01:43:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 01:43:55,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-18 01:43:55,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:43:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-18 01:43:55,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-01-18 01:43:55,402 INFO L87 Difference]: Start difference. First operand 241289 states and 914619 transitions. Second operand has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:43:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:43:58,850 INFO L93 Difference]: Finished difference Result 230729 states and 869541 transitions. [2022-01-18 01:43:58,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-18 01:43:58,850 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2022-01-18 01:43:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:43:59,830 INFO L225 Difference]: With dead ends: 230729 [2022-01-18 01:43:59,831 INFO L226 Difference]: Without dead ends: 227924 [2022-01-18 01:43:59,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2022-01-18 01:43:59,832 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 2187 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-18 01:43:59,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2187 Valid, 4049 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-18 01:44:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227924 states. [2022-01-18 01:44:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227924 to 191206. [2022-01-18 01:44:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191206 states, 191205 states have (on average 3.7748803640072173) internal successors, (721776), 191205 states have internal predecessors, (721776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:44:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191206 states to 191206 states and 721776 transitions. [2022-01-18 01:44:07,500 INFO L78 Accepts]: Start accepts. Automaton has 191206 states and 721776 transitions. Word has length 183 [2022-01-18 01:44:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:44:07,501 INFO L470 AbstractCegarLoop]: Abstraction has 191206 states and 721776 transitions. [2022-01-18 01:44:07,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:44:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 191206 states and 721776 transitions. [2022-01-18 01:44:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 01:44:08,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:44:08,254 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:44:08,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 01:44:08,254 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:44:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:44:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1573235213, now seen corresponding path program 1 times [2022-01-18 01:44:08,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:44:08,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150495812] [2022-01-18 01:44:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:44:08,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:44:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:44:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:44:08,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:44:08,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150495812] [2022-01-18 01:44:08,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150495812] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 01:44:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342264550] [2022-01-18 01:44:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:44:08,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:44:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:44:08,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 01:44:08,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-18 01:44:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:44:08,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 01:44:08,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 01:44:09,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 01:44:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:44:09,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 01:44:09,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 01:44:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:44:09,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342264550] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 01:44:09,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 01:44:09,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-01-18 01:44:09,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864662262] [2022-01-18 01:44:09,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 01:44:09,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 01:44:09,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:44:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 01:44:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2022-01-18 01:44:09,989 INFO L87 Difference]: Start difference. First operand 191206 states and 721776 transitions. Second operand has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:44:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:44:14,211 INFO L93 Difference]: Finished difference Result 292228 states and 1100065 transitions. [2022-01-18 01:44:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-18 01:44:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 states have internal predecessors, (242), 0 states have call successors, (0), 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 190 [2022-01-18 01:44:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:44:16,230 INFO L225 Difference]: With dead ends: 292228 [2022-01-18 01:44:16,231 INFO L226 Difference]: Without dead ends: 291358 [2022-01-18 01:44:16,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=632, Invalid=2124, Unknown=0, NotChecked=0, Total=2756 [2022-01-18 01:44:16,232 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 3336 mSDsluCounter, 5842 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 6075 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-18 01:44:16,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3336 Valid, 6075 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-18 01:44:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291358 states. [2022-01-18 01:44:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291358 to 264308. [2022-01-18 01:44:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264308 states, 264307 states have (on average 3.802040808605145) internal successors, (1004906), 264307 states have internal predecessors, (1004906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:44:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264308 states to 264308 states and 1004906 transitions. [2022-01-18 01:44:26,124 INFO L78 Accepts]: Start accepts. Automaton has 264308 states and 1004906 transitions. Word has length 190 [2022-01-18 01:44:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:44:26,124 INFO L470 AbstractCegarLoop]: Abstraction has 264308 states and 1004906 transitions. [2022-01-18 01:44:26,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:44:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 264308 states and 1004906 transitions. [2022-01-18 01:44:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 01:44:26,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:44:26,883 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:44:26,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-18 01:44:27,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-18 01:44:27,088 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:44:27,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:44:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash 633823237, now seen corresponding path program 1 times [2022-01-18 01:44:27,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:44:27,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023367504] [2022-01-18 01:44:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:44:27,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:44:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:44:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:44:27,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:44:27,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023367504] [2022-01-18 01:44:27,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023367504] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 01:44:27,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279031705] [2022-01-18 01:44:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:44:27,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:44:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:44:27,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 01:44:27,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-18 01:44:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:44:28,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 01:44:28,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 01:44:28,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 01:44:28,371 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 01:44:28,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 01:44:28,504 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 01:44:28,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 01:44:29,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-18 01:44:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:44:29,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 01:44:29,843 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_239 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-01-18 01:44:29,862 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_239 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0))) is different from false [2022-01-18 01:44:29,897 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_239 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (<= c_~size~0 |c_thread1Thread1of1ForFork2_#t~mem2#1|)) is different from false [2022-01-18 01:44:29,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-01-18 01:44:29,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 01:44:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:44:30,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279031705] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 01:44:30,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 01:44:30,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 21] total 68 [2022-01-18 01:44:30,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828450125] [2022-01-18 01:44:30,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 01:44:30,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-01-18 01:44:30,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:44:30,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-01-18 01:44:30,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3925, Unknown=3, NotChecked=384, Total=4556 [2022-01-18 01:44:30,673 INFO L87 Difference]: Start difference. First operand 264308 states and 1004906 transitions. Second operand has 68 states, 68 states have (on average 6.779411764705882) internal successors, (461), 68 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:44:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:44:55,290 INFO L93 Difference]: Finished difference Result 713968 states and 2710809 transitions. [2022-01-18 01:44:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2022-01-18 01:44:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 6.779411764705882) internal successors, (461), 68 states have internal predecessors, (461), 0 states have call successors, (0), 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 190 [2022-01-18 01:44:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:45:00,437 INFO L225 Difference]: With dead ends: 713968 [2022-01-18 01:45:00,437 INFO L226 Difference]: Without dead ends: 713968 [2022-01-18 01:45:00,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 349 SyntacticMatches, 25 SemanticMatches, 253 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 21334 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=6003, Invalid=57258, Unknown=3, NotChecked=1506, Total=64770 [2022-01-18 01:45:00,448 INFO L933 BasicCegarLoop]: 1475 mSDtfsCounter, 8782 mSDsluCounter, 43911 mSDsCounter, 0 mSdLazyCounter, 18176 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8782 SdHoareTripleChecker+Valid, 43637 SdHoareTripleChecker+Invalid, 24254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 18176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5944 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-01-18 01:45:00,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8782 Valid, 43637 Invalid, 24254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [134 Valid, 18176 Invalid, 0 Unknown, 5944 Unchecked, 6.6s Time] [2022-01-18 01:45:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713968 states. [2022-01-18 01:45:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713968 to 329980. [2022-01-18 01:45:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329980 states, 329979 states have (on average 3.78560150797475) internal successors, (1249169), 329979 states have internal predecessors, (1249169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:45:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329980 states to 329980 states and 1249169 transitions. [2022-01-18 01:45:17,634 INFO L78 Accepts]: Start accepts. Automaton has 329980 states and 1249169 transitions. Word has length 190 [2022-01-18 01:45:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:45:17,634 INFO L470 AbstractCegarLoop]: Abstraction has 329980 states and 1249169 transitions. [2022-01-18 01:45:17,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.779411764705882) internal successors, (461), 68 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:45:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 329980 states and 1249169 transitions. [2022-01-18 01:45:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 01:45:19,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:45:19,468 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:45:19,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-18 01:45:19,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:45:19,686 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:45:19,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:45:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1055223219, now seen corresponding path program 2 times [2022-01-18 01:45:19,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:45:19,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028468598] [2022-01-18 01:45:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:45:19,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:45:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:45:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:45:20,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:45:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028468598] [2022-01-18 01:45:20,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028468598] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 01:45:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807171557] [2022-01-18 01:45:20,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 01:45:20,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:45:20,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:45:20,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 01:45:20,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-18 01:45:20,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 01:45:20,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 01:45:20,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-18 01:45:20,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 01:45:20,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-18 01:45:20,279 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-18 01:45:20,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-18 01:45:20,397 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-18 01:45:20,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-18 01:45:21,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-18 01:45:21,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 01:45:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:45:21,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 01:45:21,739 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0)) is different from false [2022-01-18 01:45:21,756 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (= |c_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-01-18 01:45:21,806 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_283 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_283) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 0)) (<= c_~size~0 |c_thread1Thread1of1ForFork2_#t~mem2#1|)) is different from false [2022-01-18 01:45:21,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-01-18 01:45:21,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 01:45:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:45:22,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807171557] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 01:45:22,337 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 01:45:22,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 21] total 54 [2022-01-18 01:45:22,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375764801] [2022-01-18 01:45:22,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 01:45:22,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-01-18 01:45:22,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:45:22,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-01-18 01:45:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2332, Unknown=3, NotChecked=300, Total=2862 [2022-01-18 01:45:22,338 INFO L87 Difference]: Start difference. First operand 329980 states and 1249169 transitions. Second operand has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:45:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:45:30,357 INFO L93 Difference]: Finished difference Result 493806 states and 1876354 transitions. [2022-01-18 01:45:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-18 01:45:30,358 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 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 190 [2022-01-18 01:45:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:45:33,555 INFO L225 Difference]: With dead ends: 493806 [2022-01-18 01:45:33,555 INFO L226 Difference]: Without dead ends: 493806 [2022-01-18 01:45:33,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 346 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1724, Invalid=7027, Unknown=3, NotChecked=558, Total=9312 [2022-01-18 01:45:33,556 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 6393 mSDsluCounter, 9826 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6393 SdHoareTripleChecker+Valid, 9911 SdHoareTripleChecker+Invalid, 5480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2971 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-18 01:45:33,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6393 Valid, 9911 Invalid, 5480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2373 Invalid, 0 Unknown, 2971 Unchecked, 1.3s Time] [2022-01-18 01:45:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493806 states. [2022-01-18 01:45:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493806 to 314582. [2022-01-18 01:45:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314582 states, 314581 states have (on average 3.7860646383602314) internal successors, (1191024), 314581 states have internal predecessors, (1191024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:45:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314582 states to 314582 states and 1191024 transitions. [2022-01-18 01:45:46,108 INFO L78 Accepts]: Start accepts. Automaton has 314582 states and 1191024 transitions. Word has length 190 [2022-01-18 01:45:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:45:46,109 INFO L470 AbstractCegarLoop]: Abstraction has 314582 states and 1191024 transitions. [2022-01-18 01:45:46,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.222222222222222) internal successors, (390), 54 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:45:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 314582 states and 1191024 transitions. [2022-01-18 01:45:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-18 01:45:47,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:45:47,542 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:45:47,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-18 01:45:47,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:45:47,742 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:45:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:45:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1544756951, now seen corresponding path program 3 times [2022-01-18 01:45:47,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:45:47,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742864292] [2022-01-18 01:45:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:45:47,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:45:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:45:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:45:47,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:45:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742864292] [2022-01-18 01:45:47,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742864292] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 01:45:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660966612] [2022-01-18 01:45:47,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-18 01:45:47,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:45:47,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:45:47,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 01:45:47,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-18 01:45:47,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-18 01:45:47,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 01:45:47,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-18 01:45:47,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 01:45:48,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 01:45:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:45:48,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 01:45:48,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-18 01:45:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-18 01:45:48,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660966612] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 01:45:48,721 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 01:45:48,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-01-18 01:45:48,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786952753] [2022-01-18 01:45:48,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 01:45:48,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-18 01:45:48,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:45:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-18 01:45:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-01-18 01:45:48,722 INFO L87 Difference]: Start difference. First operand 314582 states and 1191024 transitions. Second operand has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:45:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:45:54,250 INFO L93 Difference]: Finished difference Result 499693 states and 1875937 transitions. [2022-01-18 01:45:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-18 01:45:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 0 states have call successors, (0), 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 190 [2022-01-18 01:45:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 01:45:57,213 INFO L225 Difference]: With dead ends: 499693 [2022-01-18 01:45:57,214 INFO L226 Difference]: Without dead ends: 488218 [2022-01-18 01:45:57,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=720, Invalid=2472, Unknown=0, NotChecked=0, Total=3192 [2022-01-18 01:45:57,214 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 3929 mSDsluCounter, 5675 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3929 SdHoareTripleChecker+Valid, 6019 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-18 01:45:57,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3929 Valid, 6019 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-18 01:45:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488218 states. [2022-01-18 01:46:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488218 to 256388. [2022-01-18 01:46:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256388 states, 256387 states have (on average 3.7571483733574635) internal successors, (963284), 256387 states have internal predecessors, (963284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:46:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256388 states to 256388 states and 963284 transitions. [2022-01-18 01:46:08,983 INFO L78 Accepts]: Start accepts. Automaton has 256388 states and 963284 transitions. Word has length 190 [2022-01-18 01:46:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 01:46:08,983 INFO L470 AbstractCegarLoop]: Abstraction has 256388 states and 963284 transitions. [2022-01-18 01:46:08,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.266666666666667) internal successors, (248), 30 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:46:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 256388 states and 963284 transitions. [2022-01-18 01:46:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-18 01:46:09,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 01:46:09,678 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 01:46:09,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-18 01:46:09,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-18 01:46:09,879 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-18 01:46:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 01:46:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 106823876, now seen corresponding path program 2 times [2022-01-18 01:46:09,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 01:46:09,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631343328] [2022-01-18 01:46:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 01:46:09,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 01:46:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 01:46:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 01:46:11,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 01:46:11,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631343328] [2022-01-18 01:46:11,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631343328] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-18 01:46:11,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113168677] [2022-01-18 01:46:11,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-18 01:46:11,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-18 01:46:11,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 01:46:11,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-18 01:46:11,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-18 01:46:11,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-18 01:46:11,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-18 01:46:11,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-18 01:46:11,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-18 01:46:12,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-18 01:46:12,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-18 01:46:12,674 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 01:46:12,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-01-18 01:46:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 01:46:12,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-18 01:46:13,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-18 01:46:13,610 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-18 01:46:13,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2022-01-18 01:46:13,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-01-18 01:46:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-18 01:46:14,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113168677] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-18 01:46:14,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-18 01:46:14,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 26, 27] total 82 [2022-01-18 01:46:14,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480184419] [2022-01-18 01:46:14,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-18 01:46:14,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-01-18 01:46:14,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 01:46:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-01-18 01:46:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=6184, Unknown=1, NotChecked=158, Total=6642 [2022-01-18 01:46:14,646 INFO L87 Difference]: Start difference. First operand 256388 states and 963284 transitions. Second operand has 82 states, 82 states have (on average 6.121951219512195) internal successors, (502), 82 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 01:46:31,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) .cse0)) is different from false [2022-01-18 01:46:50,663 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0)) is different from false [2022-01-18 01:47:04,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 01:47:14,224 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0)) is different from false [2022-01-18 01:47:14,326 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) .cse0)) is different from false [2022-01-18 01:47:14,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (< 1 c_~N~0)) (.cse1 (and (<= 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) (and (or .cse0 .cse1 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse2) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse2 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse0 .cse1))) is different from false [2022-01-18 01:47:25,444 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (< 1 c_~N~0)) (.cse1 (and (<= 1 c_~N~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))))) (and (or .cse0 .cse1 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse2) .cse2 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (not (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse0 .cse1))) is different from false [2022-01-18 01:47:33,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0) (not (< |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0))) .cse0)) is different from false [2022-01-18 01:47:49,932 WARN L228 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 94 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 01:47:57,669 WARN L228 SmtUtils]: Spent 7.40s on a formula simplification. DAG size of input: 81 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 01:47:59,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 01:48:24,788 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (<= 1 c_~N~0)) (.cse1 (< 1 c_~N~0)) (.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0) (not (< |c_thread3Thread1of1ForFork1_~i~2#1| c_~N~0))) (or .cse1 (and .cse2 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse2) .cse1) .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-01-18 01:48:44,755 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) .cse0 (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)))) is different from false [2022-01-18 01:48:46,059 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3) .cse2) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0))))) is different from false [2022-01-18 01:49:16,400 WARN L228 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 87 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 01:49:21,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (.cse1 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse3 (<= 1 c_~N~0)) (.cse2 (< 1 c_~N~0))) (and (or (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4))) 0) .cse0) (or (<= (+ c_~M~0 1) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1)) (or (< (+ |c_thread1Thread1of1ForFork2_#t~post1#1| 1) c_~N~0) .cse1) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3) .cse2) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (<= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0))) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) .cse0) (or (< (+ |c_thread1Thread1of1ForFork2_~i~0#1| 1) c_~N~0) .cse1) (or (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) .cse2))) is different from false [2022-01-18 01:52:50,276 WARN L228 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 80 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-18 01:53:55,602 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (let ((.cse8 (select (select |c_#memory_int| c_~A~0.base) .cse9)) (.cse6 (<= 1 c_~N~0))) (let ((.cse4 (and .cse6 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse3 (<= (+ c_~M~0 1) 0)) (.cse5 (< 1 c_~N~0)) (.cse7 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0))))) (.cse0 (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (.cse1 (= 0 .cse9)) (.cse2 (<= 2 .cse8))) (and (or .cse0 (and (= |c_thread3Thread1of1ForFork1_~j~2#1| 0) .cse1 .cse2)) (or .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse4 .cse5) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse4 .cse5 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse3) .cse6) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse7) .cse0 (or .cse5 (and .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_#t~post13#1| 2) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse6) .cse5) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse7 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and (not (= |c_thread3Thread1of1ForFork1_#t~mem14#1| 1)) .cse1 (= |c_thread3Thread1of1ForFork1_#t~mem14#1| .cse8))) (or .cse0 (and (= |c_thread3Thread1of1ForFork1_#t~post15#1| 0) .cse1 .cse2)))))) is different from false [2022-01-18 01:54:00,191 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_#t~post13#1| 2) c_~N~0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse3) .cse2) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-01-18 01:54:45,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or (not (< |c_thread3Thread1of1ForFork1_~j~2#1| |c_thread3Thread1of1ForFork1_#t~mem16#1|)) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0)) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-01-18 01:54:45,531 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (<= 1 c_~N~0))) (let ((.cse1 (and .cse3 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))) (.cse0 (<= (+ c_~M~0 1) 0)) (.cse2 (< 1 c_~N~0)) (.cse4 (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_369) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) 0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (or (<= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| 0) .cse1 .cse2) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (or .cse1 .cse2 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (not .cse0) .cse3) (< (+ c_~A~0.base 1) |c_ULTIMATE.start_main_~#t3~0#1.base|) (or (< |c_thread1Thread1of1ForFork2_~i~0#1| c_~N~0) .cse4) (or .cse2 (and .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (= c_~A~0.offset 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) .cse4 (< 0 c_~N~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or (<= (+ |c_thread3Thread1of1ForFork1_~j~2#1| 1) |c_thread3Thread1of1ForFork1_#t~mem16#1|) (<= (+ 2 |c_thread3Thread1of1ForFork1_~i~2#1|) c_~N~0))))) is different from false [2022-01-18 01:54:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 01:54:48,847 INFO L93 Difference]: Finished difference Result 2932149 states and 11019843 transitions. [2022-01-18 01:54:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1109 states. [2022-01-18 01:54:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 6.121951219512195) internal successors, (502), 82 states have internal predecessors, (502), 0 states have call successors, (0), 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 197 [2022-01-18 01:54:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2022-01-18 01:55:02,856 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 01:55:02,856 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-18 01:55:03,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-18 01:55:03,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown