/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:55:56,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:55:56,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:55:56,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:55:56,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:55:56,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:55:56,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:55:56,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:55:56,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:55:56,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:55:56,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:55:56,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:55:56,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:55:56,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:55:56,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:55:56,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:55:56,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:55:56,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:55:56,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:55:56,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:55:56,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:55:56,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:55:56,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:55:56,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:55:56,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:55:56,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:55:56,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:55:56,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:55:56,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:55:56,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:55:56,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:55:56,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:55:56,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:55:56,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:55:56,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:55:56,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:55:56,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:55:56,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:55:56,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:55:56,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:55:56,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:55:56,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:55:56,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:55:56,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:55:56,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:55:56,198 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:55:56,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:55:56,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:55:56,198 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:55:56,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:55:56,199 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:55:56,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:55:56,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:55:56,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:55:56,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:55:56,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:55:56,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:55:56,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:55:56,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:55:56,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:55:56,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:55:56,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:55:56,202 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:55:56,202 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:55:56,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:55:56,202 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 18:55:56,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:55:56,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:55:56,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:55:56,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:55:56,385 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:55:56,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-03-15 18:55:56,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600d315ee/0d4a72f1350843ca97acb3aac0a73200/FLAG3cce0c8dd [2022-03-15 18:55:56,800 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:55:56,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2022-03-15 18:55:56,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600d315ee/0d4a72f1350843ca97acb3aac0a73200/FLAG3cce0c8dd [2022-03-15 18:55:57,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/600d315ee/0d4a72f1350843ca97acb3aac0a73200 [2022-03-15 18:55:57,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:55:57,249 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:55:57,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:55:57,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:55:57,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:55:57,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c5f078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57, skipping insertion in model container [2022-03-15 18:55:57,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:55:57,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:55:57,418 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/parallel-misc-5.wvr.c[3027,3040] [2022-03-15 18:55:57,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:55:57,429 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:55:57,450 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/parallel-misc-5.wvr.c[3027,3040] [2022-03-15 18:55:57,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:55:57,463 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:55:57,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57 WrapperNode [2022-03-15 18:55:57,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:55:57,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:55:57,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:55:57,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:55:57,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,522 INFO L137 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-03-15 18:55:57,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:55:57,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:55:57,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:55:57,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:55:57,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:55:57,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:55:57,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:55:57,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:55:57,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (1/1) ... [2022-03-15 18:55:57,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:55:57,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:55:57,589 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-03-15 18:55:57,596 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-03-15 18:55:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:55:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:55:57,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:55:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:55:57,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:55:57,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 18:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:55:57,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:55:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:55:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:55:57,625 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:55:57,712 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:55:57,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:55:57,906 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:55:57,956 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:55:57,956 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 18:55:57,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:55:57 BoogieIcfgContainer [2022-03-15 18:55:57,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:55:57,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:55:57,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:55:57,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:55:57,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:55:57" (1/3) ... [2022-03-15 18:55:57,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7c0395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:55:57, skipping insertion in model container [2022-03-15 18:55:57,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:55:57" (2/3) ... [2022-03-15 18:55:57,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7c0395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:55:57, skipping insertion in model container [2022-03-15 18:55:57,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:55:57" (3/3) ... [2022-03-15 18:55:57,963 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-03-15 18:55:57,966 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:55:57,966 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:55:57,967 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:55:57,967 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:55:58,017 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,019 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,020 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,021 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,022 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,031 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,036 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,037 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,046 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,048 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:55:58,056 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 18:55:58,085 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:55:58,091 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:55:58,091 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 18:55:58,107 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:55:58,112 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 109 transitions, 242 flow [2022-03-15 18:55:58,116 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 109 transitions, 242 flow [2022-03-15 18:55:58,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-03-15 18:55:58,170 INFO L129 PetriNetUnfolder]: 7/106 cut-off events. [2022-03-15 18:55:58,171 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 18:55:58,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 7/106 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-03-15 18:55:58,176 INFO L116 LiptonReduction]: Number of co-enabled transitions 1250 [2022-03-15 18:56:00,734 INFO L131 LiptonReduction]: Checked pairs total: 2093 [2022-03-15 18:56:00,734 INFO L133 LiptonReduction]: Total number of compositions: 94 [2022-03-15 18:56:00,739 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 26 transitions, 76 flow [2022-03-15 18:56:00,759 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 128 states, 127 states have (on average 2.7874015748031495) internal successors, (354), 127 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 127 states have (on average 2.7874015748031495) internal successors, (354), 127 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 18:56:00,767 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:00,767 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:00,767 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -384352520, now seen corresponding path program 1 times [2022-03-15 18:56:00,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:00,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174150579] [2022-03-15 18:56:00,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:00,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:00,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174150579] [2022-03-15 18:56:00,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174150579] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:56:00,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:56:00,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:56:00,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739792612] [2022-03-15 18:56:00,981 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:00,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:01,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 135 transitions. [2022-03-15 18:56:01,005 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:01,378 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [376#(not (= (mod ~v_assert~0 256) 0)), 375#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:56:01,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 18:56:01,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:01,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 18:56:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 18:56:01,398 INFO L87 Difference]: Start difference. First operand has 128 states, 127 states have (on average 2.7874015748031495) internal successors, (354), 127 states have internal predecessors, (354), 0 states have call successors, (0), 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 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:01,490 INFO L93 Difference]: Finished difference Result 108 states and 290 transitions. [2022-03-15 18:56:01,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 18:56:01,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 18:56:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:01,499 INFO L225 Difference]: With dead ends: 108 [2022-03-15 18:56:01,499 INFO L226 Difference]: Without dead ends: 108 [2022-03-15 18:56:01,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 18:56:01,503 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:01,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:56:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-03-15 18:56:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-03-15 18:56:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.710280373831776) internal successors, (290), 107 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 290 transitions. [2022-03-15 18:56:01,541 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 290 transitions. Word has length 18 [2022-03-15 18:56:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:01,541 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 290 transitions. [2022-03-15 18:56:01,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 290 transitions. [2022-03-15 18:56:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 18:56:01,544 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:01,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:01,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:56:01,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1864377932, now seen corresponding path program 2 times [2022-03-15 18:56:01,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:01,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930312638] [2022-03-15 18:56:01,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:01,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:01,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930312638] [2022-03-15 18:56:01,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930312638] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:56:01,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:56:01,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 18:56:01,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1195166762] [2022-03-15 18:56:01,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:01,648 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:01,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 55 transitions. [2022-03-15 18:56:01,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:01,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [709#(not (= (mod ~v_assert~0 256) 0)), 708#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 710#(<= 0 ~pos~0)] [2022-03-15 18:56:01,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 18:56:01,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 18:56:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:56:01,809 INFO L87 Difference]: Start difference. First operand 108 states and 290 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:02,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:02,014 INFO L93 Difference]: Finished difference Result 182 states and 489 transitions. [2022-03-15 18:56:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 18:56:02,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 18:56:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:02,015 INFO L225 Difference]: With dead ends: 182 [2022-03-15 18:56:02,015 INFO L226 Difference]: Without dead ends: 128 [2022-03-15 18:56:02,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-03-15 18:56:02,016 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:02,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:56:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-03-15 18:56:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-03-15 18:56:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.6929133858267718) internal successors, (342), 127 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 342 transitions. [2022-03-15 18:56:02,022 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 342 transitions. Word has length 18 [2022-03-15 18:56:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:02,023 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 342 transitions. [2022-03-15 18:56:02,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 342 transitions. [2022-03-15 18:56:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:56:02,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:02,024 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] [2022-03-15 18:56:02,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:56:02,024 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:02,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:02,025 INFO L85 PathProgramCache]: Analyzing trace with hash -978096258, now seen corresponding path program 1 times [2022-03-15 18:56:02,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:02,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455694175] [2022-03-15 18:56:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:02,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:02,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455694175] [2022-03-15 18:56:02,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455694175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:56:02,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:56:02,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:56:02,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1583603829] [2022-03-15 18:56:02,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:02,107 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:02,114 INFO L252 McrAutomatonBuilder]: Finished intersection with 64 states and 121 transitions. [2022-03-15 18:56:02,114 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:02,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [1173#(or (not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 1171#(not (= (mod ~v_assert~0 256) 0)), 1177#(or (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), 1178#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) ~v_assert~0) (+ (* 256 (div ~v_assert~0 256)) |thread2Thread1of1ForFork1_~cond~1#1|)), 1170#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 1176#(<= ~v_assert~0 (* 256 (div ~v_assert~0 256))), 1174#(or (not (= (mod ~v_assert~0 256) 0)) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 1175#(or (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 1172#(not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), 1179#(or (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (not (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:56:02,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:02,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:56:02,552 INFO L87 Difference]: Start difference. First operand 128 states and 342 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:03,034 INFO L93 Difference]: Finished difference Result 136 states and 348 transitions. [2022-03-15 18:56:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:56:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:56:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:03,035 INFO L225 Difference]: With dead ends: 136 [2022-03-15 18:56:03,035 INFO L226 Difference]: Without dead ends: 124 [2022-03-15 18:56:03,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:56:03,036 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:03,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-03-15 18:56:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2022-03-15 18:56:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.5210084033613445) internal successors, (300), 119 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 300 transitions. [2022-03-15 18:56:03,040 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 300 transitions. Word has length 20 [2022-03-15 18:56:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:03,041 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 300 transitions. [2022-03-15 18:56:03,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 15 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 300 transitions. [2022-03-15 18:56:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:56:03,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:03,042 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] [2022-03-15 18:56:03,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 18:56:03,042 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1574544546, now seen corresponding path program 2 times [2022-03-15 18:56:03,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:03,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140252907] [2022-03-15 18:56:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:03,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:03,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140252907] [2022-03-15 18:56:03,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140252907] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:56:03,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:56:03,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:56:03,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1408162834] [2022-03-15 18:56:03,134 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:03,135 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:03,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 78 transitions. [2022-03-15 18:56:03,141 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:03,423 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1605#(not (= (mod ~v_assert~0 256) 0)), 1604#(not (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), 1606#(<= 0 ~pos~0), 1607#(and (or (<= 1 ~pos~0) (<= ~c1~0 0)) (<= 0 (+ ~pos~0 1)))] [2022-03-15 18:56:03,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:56:03,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:03,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:56:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:56:03,425 INFO L87 Difference]: Start difference. First operand 120 states and 300 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:03,916 INFO L93 Difference]: Finished difference Result 390 states and 938 transitions. [2022-03-15 18:56:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:56:03,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:56:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:03,918 INFO L225 Difference]: With dead ends: 390 [2022-03-15 18:56:03,918 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 18:56:03,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:56:03,923 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:03,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 18:56:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 184. [2022-03-15 18:56:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.612021857923497) internal successors, (478), 183 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 478 transitions. [2022-03-15 18:56:03,941 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 478 transitions. Word has length 20 [2022-03-15 18:56:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:03,941 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 478 transitions. [2022-03-15 18:56:03,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 478 transitions. [2022-03-15 18:56:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 18:56:03,942 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:03,942 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] [2022-03-15 18:56:03,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:56:03,942 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1079347585, now seen corresponding path program 1 times [2022-03-15 18:56:03,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:03,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711920544] [2022-03-15 18:56:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:03,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:04,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:04,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711920544] [2022-03-15 18:56:04,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711920544] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:56:04,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:56:04,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 18:56:04,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092301703] [2022-03-15 18:56:04,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:04,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:04,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 70 transitions. [2022-03-15 18:56:04,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:04,191 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2409#(not (= (mod ~v_assert~0 256) 0)), 2408#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:56:04,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 18:56:04,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 18:56:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-15 18:56:04,192 INFO L87 Difference]: Start difference. First operand 184 states and 478 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:04,424 INFO L93 Difference]: Finished difference Result 236 states and 592 transitions. [2022-03-15 18:56:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:56:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 18:56:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:04,426 INFO L225 Difference]: With dead ends: 236 [2022-03-15 18:56:04,426 INFO L226 Difference]: Without dead ends: 184 [2022-03-15 18:56:04,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:56:04,426 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:04,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:56:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-03-15 18:56:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-03-15 18:56:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.568306010928962) internal successors, (470), 183 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 470 transitions. [2022-03-15 18:56:04,431 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 470 transitions. Word has length 20 [2022-03-15 18:56:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:04,431 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 470 transitions. [2022-03-15 18:56:04,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 470 transitions. [2022-03-15 18:56:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:56:04,432 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:04,432 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:04,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 18:56:04,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1930851408, now seen corresponding path program 2 times [2022-03-15 18:56:04,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:04,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326186779] [2022-03-15 18:56:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:04,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:04,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326186779] [2022-03-15 18:56:04,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326186779] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:04,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339247257] [2022-03-15 18:56:04,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:04,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:04,541 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-03-15 18:56:04,543 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-03-15 18:56:04,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:04,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:04,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 18:56:04,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:04,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:05,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339247257] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:05,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:05,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 18:56:05,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613624738] [2022-03-15 18:56:05,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:05,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:05,187 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 84 transitions. [2022-03-15 18:56:05,187 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:05,574 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3174#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 3126#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:56:05,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:56:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-15 18:56:05,574 INFO L87 Difference]: Start difference. First operand 184 states and 470 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:05,865 INFO L93 Difference]: Finished difference Result 252 states and 636 transitions. [2022-03-15 18:56:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:56:05,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 22 [2022-03-15 18:56:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:05,866 INFO L225 Difference]: With dead ends: 252 [2022-03-15 18:56:05,866 INFO L226 Difference]: Without dead ends: 200 [2022-03-15 18:56:05,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:56:05,867 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:05,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:56:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-03-15 18:56:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2022-03-15 18:56:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.572192513368984) internal successors, (481), 187 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 481 transitions. [2022-03-15 18:56:05,871 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 481 transitions. Word has length 22 [2022-03-15 18:56:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:05,871 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 481 transitions. [2022-03-15 18:56:05,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 481 transitions. [2022-03-15 18:56:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:56:05,871 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:05,872 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:05,909 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-03-15 18:56:06,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 18:56:06,083 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 305985525, now seen corresponding path program 1 times [2022-03-15 18:56:06,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:06,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848415872] [2022-03-15 18:56:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:06,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:06,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848415872] [2022-03-15 18:56:06,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848415872] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:06,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938292739] [2022-03-15 18:56:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:06,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:06,212 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-03-15 18:56:06,213 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-03-15 18:56:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:06,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 18:56:06,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:06,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:06,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938292739] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:06,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:06,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-03-15 18:56:06,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798469910] [2022-03-15 18:56:06,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:06,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:06,919 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 158 transitions. [2022-03-15 18:56:06,919 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:08,491 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3985#(and (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 3936#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 3940#(not (<= (mod ~v_assert~0 256) 0)), 3986#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 3984#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0))), 3987#(and (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:56:08,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:56:08,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:56:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:56:08,492 INFO L87 Difference]: Start difference. First operand 188 states and 481 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:08,956 INFO L93 Difference]: Finished difference Result 342 states and 854 transitions. [2022-03-15 18:56:08,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:56:08,956 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:56:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:08,958 INFO L225 Difference]: With dead ends: 342 [2022-03-15 18:56:08,958 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 18:56:08,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:56:08,959 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:08,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 18:56:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 220. [2022-03-15 18:56:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.584474885844749) internal successors, (566), 219 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 566 transitions. [2022-03-15 18:56:08,969 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 566 transitions. Word has length 24 [2022-03-15 18:56:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:08,969 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 566 transitions. [2022-03-15 18:56:08,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 566 transitions. [2022-03-15 18:56:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:56:08,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:08,970 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:09,001 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-03-15 18:56:09,170 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,SelfDestructingSolverStorable6 [2022-03-15 18:56:09,171 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -87292041, now seen corresponding path program 2 times [2022-03-15 18:56:09,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:09,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52365167] [2022-03-15 18:56:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:09,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:09,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52365167] [2022-03-15 18:56:09,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52365167] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:09,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587850759] [2022-03-15 18:56:09,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:09,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:09,292 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-03-15 18:56:09,302 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-03-15 18:56:09,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:09,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:09,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 18:56:09,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:09,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:10,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587850759] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:10,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:10,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 18:56:10,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907577836] [2022-03-15 18:56:10,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:10,053 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:10,066 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 154 transitions. [2022-03-15 18:56:10,066 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:11,412 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [4956#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (= (+ ~pos~0 2) 0)) (or (= ~pos~0 0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1))), 4957#(and (or (= ~pos~0 0) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (= (+ ~pos~0 2) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 4913#(not (<= (mod ~v_assert~0 256) 0)), 4909#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 18:56:11,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:56:11,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:56:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:56:11,413 INFO L87 Difference]: Start difference. First operand 220 states and 566 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:11,747 INFO L93 Difference]: Finished difference Result 330 states and 830 transitions. [2022-03-15 18:56:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:56:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:56:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:11,749 INFO L225 Difference]: With dead ends: 330 [2022-03-15 18:56:11,749 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 18:56:11,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:11,749 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 117 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:11,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 8 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 18:56:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2022-03-15 18:56:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.595744680851064) internal successors, (610), 235 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 610 transitions. [2022-03-15 18:56:11,757 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 610 transitions. Word has length 24 [2022-03-15 18:56:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:11,757 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 610 transitions. [2022-03-15 18:56:11,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 610 transitions. [2022-03-15 18:56:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:56:11,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:11,762 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:11,779 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-03-15 18:56:11,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:11,979 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash 509167248, now seen corresponding path program 3 times [2022-03-15 18:56:11,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:11,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659791509] [2022-03-15 18:56:11,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:12,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:12,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659791509] [2022-03-15 18:56:12,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659791509] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:12,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862848998] [2022-03-15 18:56:12,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:12,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:12,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:12,073 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-03-15 18:56:12,099 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-03-15 18:56:12,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 18:56:12,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:12,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 18:56:12,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:12,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:12,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862848998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:12,711 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:12,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 18:56:12,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029236822] [2022-03-15 18:56:12,712 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:12,715 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:12,726 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 128 transitions. [2022-03-15 18:56:12,726 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:13,431 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [5895#(not (<= (mod ~v_assert~0 256) 0)), 5938#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 5891#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 5939#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:56:13,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:56:13,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:56:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:56:13,432 INFO L87 Difference]: Start difference. First operand 236 states and 610 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:13,775 INFO L93 Difference]: Finished difference Result 330 states and 830 transitions. [2022-03-15 18:56:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:56:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:56:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:13,777 INFO L225 Difference]: With dead ends: 330 [2022-03-15 18:56:13,778 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 18:56:13,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:13,779 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 107 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:13,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 7 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 18:56:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 228. [2022-03-15 18:56:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.590308370044053) internal successors, (588), 227 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 588 transitions. [2022-03-15 18:56:13,783 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 588 transitions. Word has length 24 [2022-03-15 18:56:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:13,784 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 588 transitions. [2022-03-15 18:56:13,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 588 transitions. [2022-03-15 18:56:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:56:13,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:13,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:13,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 18:56:13,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:13,999 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1852978231, now seen corresponding path program 4 times [2022-03-15 18:56:14,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:14,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78738601] [2022-03-15 18:56:14,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:14,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:14,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78738601] [2022-03-15 18:56:14,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78738601] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:14,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683465572] [2022-03-15 18:56:14,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:56:14,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:14,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:14,077 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-03-15 18:56:14,078 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-03-15 18:56:14,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:56:14,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:14,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 18:56:14,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:14,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:14,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683465572] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:14,761 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:14,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-03-15 18:56:14,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796170331] [2022-03-15 18:56:14,761 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:14,764 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:14,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 124 transitions. [2022-03-15 18:56:14,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:15,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6849#(not (<= (mod ~v_assert~0 256) 0)), 6905#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:56:15,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:56:15,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:56:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:56:15,375 INFO L87 Difference]: Start difference. First operand 228 states and 588 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:15,660 INFO L93 Difference]: Finished difference Result 314 states and 805 transitions. [2022-03-15 18:56:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 18:56:15,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:56:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:15,662 INFO L225 Difference]: With dead ends: 314 [2022-03-15 18:56:15,662 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 18:56:15,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:15,663 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:15,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 18:56:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2022-03-15 18:56:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.595744680851064) internal successors, (610), 235 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 610 transitions. [2022-03-15 18:56:15,667 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 610 transitions. Word has length 24 [2022-03-15 18:56:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:15,667 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 610 transitions. [2022-03-15 18:56:15,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 610 transitions. [2022-03-15 18:56:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:56:15,668 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:15,668 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:15,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 18:56:15,880 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,SelfDestructingSolverStorable9 [2022-03-15 18:56:15,881 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 826328468, now seen corresponding path program 5 times [2022-03-15 18:56:15,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:15,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443889192] [2022-03-15 18:56:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:15,979 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:15,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443889192] [2022-03-15 18:56:15,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443889192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:15,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510201686] [2022-03-15 18:56:15,979 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:56:15,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:15,980 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-03-15 18:56:15,981 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-03-15 18:56:16,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 18:56:16,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:16,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 18:56:16,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:16,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:16,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:16,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510201686] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:16,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:16,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 18:56:16,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054860765] [2022-03-15 18:56:16,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:16,718 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:16,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 146 transitions. [2022-03-15 18:56:16,730 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:17,664 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7826#(not (<= (mod ~v_assert~0 256) 0)), 7822#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 18:56:17,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:56:17,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:56:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-03-15 18:56:17,665 INFO L87 Difference]: Start difference. First operand 236 states and 610 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:17,968 INFO L93 Difference]: Finished difference Result 322 states and 827 transitions. [2022-03-15 18:56:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-15 18:56:17,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:56:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:17,969 INFO L225 Difference]: With dead ends: 322 [2022-03-15 18:56:17,969 INFO L226 Difference]: Without dead ends: 276 [2022-03-15 18:56:17,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:56:17,970 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:17,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-03-15 18:56:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 244. [2022-03-15 18:56:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.60082304526749) internal successors, (632), 243 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 632 transitions. [2022-03-15 18:56:17,975 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 632 transitions. Word has length 24 [2022-03-15 18:56:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:17,976 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 632 transitions. [2022-03-15 18:56:17,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 632 transitions. [2022-03-15 18:56:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 18:56:17,976 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:17,976 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:18,009 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-03-15 18:56:18,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:18,177 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 75873823, now seen corresponding path program 3 times [2022-03-15 18:56:18,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:18,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375897676] [2022-03-15 18:56:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:18,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:18,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375897676] [2022-03-15 18:56:18,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375897676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:18,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273845067] [2022-03-15 18:56:18,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:18,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:18,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 18:56:18,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 18:56:18,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:18,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-15 18:56:18,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:18,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:18,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273845067] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:18,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:18,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 18:56:18,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327625534] [2022-03-15 18:56:18,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:18,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:18,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 98 transitions. [2022-03-15 18:56:18,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:19,415 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8860#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 8804#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:19,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:56:19,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:19,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:56:19,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-03-15 18:56:19,416 INFO L87 Difference]: Start difference. First operand 244 states and 632 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:19,729 INFO L93 Difference]: Finished difference Result 312 states and 798 transitions. [2022-03-15 18:56:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:56:19,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 18:56:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:19,731 INFO L225 Difference]: With dead ends: 312 [2022-03-15 18:56:19,731 INFO L226 Difference]: Without dead ends: 260 [2022-03-15 18:56:19,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:56:19,732 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:19,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-03-15 18:56:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 244. [2022-03-15 18:56:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.60082304526749) internal successors, (632), 243 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 632 transitions. [2022-03-15 18:56:19,736 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 632 transitions. Word has length 24 [2022-03-15 18:56:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:19,737 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 632 transitions. [2022-03-15 18:56:19,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 632 transitions. [2022-03-15 18:56:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:19,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:19,737 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:19,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:19,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:19,947 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1983871755, now seen corresponding path program 6 times [2022-03-15 18:56:19,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:19,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265695073] [2022-03-15 18:56:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:20,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:20,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265695073] [2022-03-15 18:56:20,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265695073] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:20,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382884933] [2022-03-15 18:56:20,041 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:56:20,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:20,042 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:20,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 18:56:20,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 18:56:20,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:20,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:20,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:20,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:21,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382884933] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:21,042 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:21,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-03-15 18:56:21,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [149808363] [2022-03-15 18:56:21,043 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:21,045 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:21,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 198 transitions. [2022-03-15 18:56:21,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:22,654 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [9860#(and (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 9805#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 9861#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 9859#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0))), 9862#(and (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 9809#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:22,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:22,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:56:22,655 INFO L87 Difference]: Start difference. First operand 244 states and 632 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:23,266 INFO L93 Difference]: Finished difference Result 458 states and 1164 transitions. [2022-03-15 18:56:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:56:23,267 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:23,268 INFO L225 Difference]: With dead ends: 458 [2022-03-15 18:56:23,268 INFO L226 Difference]: Without dead ends: 360 [2022-03-15 18:56:23,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 18:56:23,269 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:23,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-03-15 18:56:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 264. [2022-03-15 18:56:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.6007604562737643) internal successors, (684), 263 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 684 transitions. [2022-03-15 18:56:23,274 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 684 transitions. Word has length 26 [2022-03-15 18:56:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:23,274 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 684 transitions. [2022-03-15 18:56:23,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 684 transitions. [2022-03-15 18:56:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:23,275 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:23,275 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:23,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:23,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 18:56:23,475 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:23,475 INFO L85 PathProgramCache]: Analyzing trace with hash -370825269, now seen corresponding path program 7 times [2022-03-15 18:56:23,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:23,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039948824] [2022-03-15 18:56:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:23,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:23,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039948824] [2022-03-15 18:56:23,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039948824] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:23,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552481919] [2022-03-15 18:56:23,640 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:56:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:23,660 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:23,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 18:56:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:23,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:23,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:24,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:24,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552481919] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:24,689 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:24,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 18:56:24,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050161709] [2022-03-15 18:56:24,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:24,692 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:24,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 168 transitions. [2022-03-15 18:56:24,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:26,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [11006#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 11060#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (= (+ ~pos~0 2) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0))), 11061#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (= (+ ~pos~0 2) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 11010#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:26,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:56:26,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:26,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:56:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:56:26,126 INFO L87 Difference]: Start difference. First operand 264 states and 684 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:26,515 INFO L93 Difference]: Finished difference Result 390 states and 992 transitions. [2022-03-15 18:56:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:56:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:26,516 INFO L225 Difference]: With dead ends: 390 [2022-03-15 18:56:26,516 INFO L226 Difference]: Without dead ends: 344 [2022-03-15 18:56:26,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:56:26,517 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 124 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:26,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 8 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-03-15 18:56:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 296. [2022-03-15 18:56:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 2.616949152542373) internal successors, (772), 295 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 772 transitions. [2022-03-15 18:56:26,524 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 772 transitions. Word has length 26 [2022-03-15 18:56:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:26,524 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 772 transitions. [2022-03-15 18:56:26,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 772 transitions. [2022-03-15 18:56:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:26,525 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:26,525 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:26,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:26,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 18:56:26,725 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1697255130, now seen corresponding path program 8 times [2022-03-15 18:56:26,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:26,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212611330] [2022-03-15 18:56:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:26,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:26,847 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:26,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212611330] [2022-03-15 18:56:26,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212611330] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:26,847 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385406370] [2022-03-15 18:56:26,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:26,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:26,849 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:26,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 18:56:26,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:26,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:26,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:26,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:27,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:27,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385406370] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:27,706 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:27,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 18:56:27,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474056370] [2022-03-15 18:56:27,706 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:27,709 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:27,743 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 190 transitions. [2022-03-15 18:56:27,743 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:28,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [12185#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 12189#(not (<= (mod ~v_assert~0 256) 0)), 12239#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 12240#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 12241#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 12242#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:56:28,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:28,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:56:28,826 INFO L87 Difference]: Start difference. First operand 296 states and 772 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:29,189 INFO L93 Difference]: Finished difference Result 446 states and 1127 transitions. [2022-03-15 18:56:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:56:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:29,193 INFO L225 Difference]: With dead ends: 446 [2022-03-15 18:56:29,193 INFO L226 Difference]: Without dead ends: 400 [2022-03-15 18:56:29,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1221, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 18:56:29,196 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 157 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:29,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 6 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-03-15 18:56:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 272. [2022-03-15 18:56:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.6051660516605164) internal successors, (706), 271 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 706 transitions. [2022-03-15 18:56:29,211 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 706 transitions. Word has length 26 [2022-03-15 18:56:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:29,211 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 706 transitions. [2022-03-15 18:56:29,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 706 transitions. [2022-03-15 18:56:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:29,211 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:29,211 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:29,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:29,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 18:56:29,412 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash 213099659, now seen corresponding path program 9 times [2022-03-15 18:56:29,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:29,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108243015] [2022-03-15 18:56:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:29,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:29,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108243015] [2022-03-15 18:56:29,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108243015] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:29,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994359438] [2022-03-15 18:56:29,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:29,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:29,492 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:29,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 18:56:29,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 18:56:29,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:29,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:29,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:29,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:30,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994359438] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:30,502 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:30,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-03-15 18:56:30,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704185381] [2022-03-15 18:56:30,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:30,504 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:30,517 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 138 transitions. [2022-03-15 18:56:30,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:31,277 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13370#(not (<= (mod ~v_assert~0 256) 0)), 13431#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:56:31,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:56:31,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:56:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 18:56:31,278 INFO L87 Difference]: Start difference. First operand 272 states and 706 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:31,597 INFO L93 Difference]: Finished difference Result 374 states and 967 transitions. [2022-03-15 18:56:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:56:31,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:31,599 INFO L225 Difference]: With dead ends: 374 [2022-03-15 18:56:31,599 INFO L226 Difference]: Without dead ends: 328 [2022-03-15 18:56:31,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:56:31,600 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:31,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:56:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-15 18:56:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 312. [2022-03-15 18:56:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.6237942122186495) internal successors, (816), 311 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 816 transitions. [2022-03-15 18:56:31,604 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 816 transitions. Word has length 26 [2022-03-15 18:56:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:31,605 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 816 transitions. [2022-03-15 18:56:31,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 816 transitions. [2022-03-15 18:56:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:31,605 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:31,605 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:31,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:31,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 18:56:31,821 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1113330202, now seen corresponding path program 10 times [2022-03-15 18:56:31,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:31,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250251016] [2022-03-15 18:56:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:31,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:31,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250251016] [2022-03-15 18:56:31,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250251016] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:31,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236001580] [2022-03-15 18:56:31,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:56:31,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:31,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:31,923 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:31,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 18:56:32,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:56:32,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:32,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:32,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:32,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:32,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236001580] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:32,903 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:32,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 18:56:32,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1442861541] [2022-03-15 18:56:32,903 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:32,906 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:32,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2022-03-15 18:56:32,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:34,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [14574#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 14629#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 14628#(and (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 14630#(and (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 14578#(not (<= (mod ~v_assert~0 256) 0)), 14627#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 0)))] [2022-03-15 18:56:34,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:56:34,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:56:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:56:34,652 INFO L87 Difference]: Start difference. First operand 312 states and 816 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:35,113 INFO L93 Difference]: Finished difference Result 446 states and 1146 transitions. [2022-03-15 18:56:35,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:56:35,113 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:35,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:35,121 INFO L225 Difference]: With dead ends: 446 [2022-03-15 18:56:35,121 INFO L226 Difference]: Without dead ends: 400 [2022-03-15 18:56:35,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:56:35,124 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:35,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-03-15 18:56:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 328. [2022-03-15 18:56:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.6299694189602447) internal successors, (860), 327 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 860 transitions. [2022-03-15 18:56:35,141 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 860 transitions. Word has length 26 [2022-03-15 18:56:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:35,141 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 860 transitions. [2022-03-15 18:56:35,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 860 transitions. [2022-03-15 18:56:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:35,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:35,142 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:35,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 18:56:35,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 18:56:35,347 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -813550104, now seen corresponding path program 11 times [2022-03-15 18:56:35,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:35,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100184744] [2022-03-15 18:56:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:35,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:35,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100184744] [2022-03-15 18:56:35,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100184744] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:35,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701225369] [2022-03-15 18:56:35,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:56:35,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:35,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:35,469 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:35,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 18:56:35,533 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 18:56:35,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:35,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:35,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:35,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:36,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701225369] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:36,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:36,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 18:56:36,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424401208] [2022-03-15 18:56:36,332 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:36,334 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:36,349 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2022-03-15 18:56:36,349 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:37,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [15888#(not (<= (mod ~v_assert~0 256) 0)), 15939#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 15884#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 15938#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)))] [2022-03-15 18:56:37,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:56:37,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:37,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:56:37,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2022-03-15 18:56:37,522 INFO L87 Difference]: Start difference. First operand 328 states and 860 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:37,900 INFO L93 Difference]: Finished difference Result 462 states and 1190 transitions. [2022-03-15 18:56:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:56:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:37,902 INFO L225 Difference]: With dead ends: 462 [2022-03-15 18:56:37,902 INFO L226 Difference]: Without dead ends: 416 [2022-03-15 18:56:37,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:56:37,903 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 110 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:37,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 8 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-03-15 18:56:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 328. [2022-03-15 18:56:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.6299694189602447) internal successors, (860), 327 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 860 transitions. [2022-03-15 18:56:37,908 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 860 transitions. Word has length 26 [2022-03-15 18:56:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:37,909 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 860 transitions. [2022-03-15 18:56:37,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 860 transitions. [2022-03-15 18:56:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:37,909 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:37,909 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:37,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:38,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 18:56:38,119 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1445155496, now seen corresponding path program 12 times [2022-03-15 18:56:38,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:38,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170377654] [2022-03-15 18:56:38,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:38,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:38,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170377654] [2022-03-15 18:56:38,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170377654] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:38,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468371932] [2022-03-15 18:56:38,213 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:56:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:38,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:38,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 18:56:38,293 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 18:56:38,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:38,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:38,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:38,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:39,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468371932] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:39,279 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:39,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 18:56:39,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322493766] [2022-03-15 18:56:39,279 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:39,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:39,296 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 160 transitions. [2022-03-15 18:56:39,296 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:40,181 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17255#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 17193#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:40,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:56:40,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:40,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:56:40,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-03-15 18:56:40,182 INFO L87 Difference]: Start difference. First operand 328 states and 860 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:40,478 INFO L93 Difference]: Finished difference Result 446 states and 1165 transitions. [2022-03-15 18:56:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:56:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:40,480 INFO L225 Difference]: With dead ends: 446 [2022-03-15 18:56:40,480 INFO L226 Difference]: Without dead ends: 400 [2022-03-15 18:56:40,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:56:40,481 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:40,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:56:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-03-15 18:56:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 336. [2022-03-15 18:56:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.6328358208955223) internal successors, (882), 335 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 882 transitions. [2022-03-15 18:56:40,487 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 882 transitions. Word has length 26 [2022-03-15 18:56:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:40,487 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 882 transitions. [2022-03-15 18:56:40,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 882 transitions. [2022-03-15 18:56:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 18:56:40,488 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:40,488 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:40,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:40,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:40,699 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash 418505733, now seen corresponding path program 13 times [2022-03-15 18:56:40,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:40,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19151856] [2022-03-15 18:56:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:40,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:40,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19151856] [2022-03-15 18:56:40,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19151856] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:40,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516284006] [2022-03-15 18:56:40,831 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:56:40,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:40,832 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:40,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 18:56:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:40,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 18:56:40,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:41,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:41,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516284006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:41,801 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:41,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-03-15 18:56:41,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [19334054] [2022-03-15 18:56:41,801 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:41,803 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:41,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2022-03-15 18:56:41,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:42,896 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [18516#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 18520#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:42,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 18:56:42,896 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 18:56:42,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-03-15 18:56:42,897 INFO L87 Difference]: Start difference. First operand 336 states and 882 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:43,249 INFO L93 Difference]: Finished difference Result 444 states and 1160 transitions. [2022-03-15 18:56:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:56:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 18:56:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:43,251 INFO L225 Difference]: With dead ends: 444 [2022-03-15 18:56:43,251 INFO L226 Difference]: Without dead ends: 384 [2022-03-15 18:56:43,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 98 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 18:56:43,252 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:43,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-03-15 18:56:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 336. [2022-03-15 18:56:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.6328358208955223) internal successors, (882), 335 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 882 transitions. [2022-03-15 18:56:43,257 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 882 transitions. Word has length 26 [2022-03-15 18:56:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:43,257 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 882 transitions. [2022-03-15 18:56:43,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 882 transitions. [2022-03-15 18:56:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:56:43,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:43,258 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:43,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:43,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:43,458 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1447724639, now seen corresponding path program 14 times [2022-03-15 18:56:43,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:43,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407948520] [2022-03-15 18:56:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:43,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:43,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407948520] [2022-03-15 18:56:43,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407948520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:43,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539537482] [2022-03-15 18:56:43,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:56:43,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:43,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:43,580 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:43,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 18:56:43,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:56:43,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:43,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:56:43,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:44,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:44,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539537482] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:44,995 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:44,995 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:56:44,995 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68786480] [2022-03-15 18:56:44,995 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:44,998 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:45,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 212 transitions. [2022-03-15 18:56:45,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:46,630 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [19847#(not (<= (mod ~v_assert~0 256) 0)), 19906#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 19907#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 19908#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 19905#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 19843#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 18:56:46,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:56:46,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:56:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:56:46,631 INFO L87 Difference]: Start difference. First operand 336 states and 882 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:47,130 INFO L93 Difference]: Finished difference Result 540 states and 1399 transitions. [2022-03-15 18:56:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:56:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 18:56:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:47,134 INFO L225 Difference]: With dead ends: 540 [2022-03-15 18:56:47,134 INFO L226 Difference]: Without dead ends: 484 [2022-03-15 18:56:47,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 103 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=1800, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:56:47,137 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:47,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-03-15 18:56:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 380. [2022-03-15 18:56:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 2.638522427440633) internal successors, (1000), 379 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1000 transitions. [2022-03-15 18:56:47,171 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1000 transitions. Word has length 28 [2022-03-15 18:56:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:47,171 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 1000 transitions. [2022-03-15 18:56:47,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1000 transitions. [2022-03-15 18:56:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:56:47,172 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:47,172 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:47,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:47,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:47,386 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 121294778, now seen corresponding path program 15 times [2022-03-15 18:56:47,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:47,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433184367] [2022-03-15 18:56:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:47,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:47,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433184367] [2022-03-15 18:56:47,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433184367] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:47,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342812537] [2022-03-15 18:56:47,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:56:47,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:47,526 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:47,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 18:56:47,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 18:56:47,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:47,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:56:47,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:48,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:49,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342812537] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:49,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:49,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:56:49,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1884218874] [2022-03-15 18:56:49,201 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:49,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:49,233 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 234 transitions. [2022-03-15 18:56:49,234 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:51,385 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [21437#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 21370#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 21435#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 21374#(not (<= (mod ~v_assert~0 256) 0)), 21433#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 21434#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 21436#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 21432#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)))] [2022-03-15 18:56:51,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:56:51,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:51,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:56:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:56:51,387 INFO L87 Difference]: Start difference. First operand 380 states and 1000 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:52,097 INFO L93 Difference]: Finished difference Result 546 states and 1399 transitions. [2022-03-15 18:56:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:56:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 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 28 [2022-03-15 18:56:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:52,098 INFO L225 Difference]: With dead ends: 546 [2022-03-15 18:56:52,099 INFO L226 Difference]: Without dead ends: 500 [2022-03-15 18:56:52,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 111 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=333, Invalid=1829, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:56:52,099 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:52,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 18:56:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-03-15 18:56:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 380. [2022-03-15 18:56:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 2.638522427440633) internal successors, (1000), 379 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1000 transitions. [2022-03-15 18:56:52,105 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1000 transitions. Word has length 28 [2022-03-15 18:56:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:52,105 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 1000 transitions. [2022-03-15 18:56:52,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1000 transitions. [2022-03-15 18:56:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:56:52,106 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:52,106 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:52,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:52,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:52,307 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:52,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2088021139, now seen corresponding path program 16 times [2022-03-15 18:56:52,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:52,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911827922] [2022-03-15 18:56:52,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:52,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:52,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:52,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911827922] [2022-03-15 18:56:52,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911827922] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:52,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261777967] [2022-03-15 18:56:52,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:56:52,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:52,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:52,421 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:52,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 18:56:52,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:56:52,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:52,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:56:52,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:52,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:53,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261777967] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:53,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:53,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:56:53,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233434928] [2022-03-15 18:56:53,900 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:53,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:53,922 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 186 transitions. [2022-03-15 18:56:53,922 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:55,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [22966#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 22901#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 22963#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0))), 22965#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 22964#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 22905#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:56:55,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:56:55,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:56:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:56:55,336 INFO L87 Difference]: Start difference. First operand 380 states and 1000 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:56,017 INFO L93 Difference]: Finished difference Result 570 states and 1484 transitions. [2022-03-15 18:56:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:56:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 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 28 [2022-03-15 18:56:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:56,019 INFO L225 Difference]: With dead ends: 570 [2022-03-15 18:56:56,019 INFO L226 Difference]: Without dead ends: 524 [2022-03-15 18:56:56,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 87 SyntacticMatches, 20 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=402, Invalid=1854, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 18:56:56,020 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:56,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:56:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-15 18:56:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 396. [2022-03-15 18:56:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.643037974683544) internal successors, (1044), 395 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1044 transitions. [2022-03-15 18:56:56,026 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1044 transitions. Word has length 28 [2022-03-15 18:56:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:56,026 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 1044 transitions. [2022-03-15 18:56:56,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1044 transitions. [2022-03-15 18:56:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:56:56,027 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:56,027 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:56,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:56,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:56,242 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2031649567, now seen corresponding path program 17 times [2022-03-15 18:56:56,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:56,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492367746] [2022-03-15 18:56:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:56,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:56,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492367746] [2022-03-15 18:56:56,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492367746] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:56,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105615731] [2022-03-15 18:56:56,374 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:56:56,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:56,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:56,392 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:56,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 18:56:56,491 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 18:56:56,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:56,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:56:56,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:56,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:56:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:57,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105615731] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:56:57,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:56:57,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:56:57,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930690957] [2022-03-15 18:56:57,483 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:56:57,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:56:57,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 182 transitions. [2022-03-15 18:56:57,525 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:56:58,640 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [24492#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 24496#(not (<= (mod ~v_assert~0 256) 0)), 24554#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 24555#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:56:58,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:56:58,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:56:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:56:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:56:58,641 INFO L87 Difference]: Start difference. First operand 396 states and 1044 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:56:58,992 INFO L93 Difference]: Finished difference Result 562 states and 1462 transitions. [2022-03-15 18:56:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:56:58,992 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 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 28 [2022-03-15 18:56:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:56:58,994 INFO L225 Difference]: With dead ends: 562 [2022-03-15 18:56:58,994 INFO L226 Difference]: Without dead ends: 516 [2022-03-15 18:56:58,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 20 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=1410, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 18:56:58,998 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 146 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:56:58,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 6 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:56:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-15 18:56:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 428. [2022-03-15 18:56:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.651053864168618) internal successors, (1132), 427 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1132 transitions. [2022-03-15 18:56:59,020 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1132 transitions. Word has length 28 [2022-03-15 18:56:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:56:59,021 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1132 transitions. [2022-03-15 18:56:59,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:56:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1132 transitions. [2022-03-15 18:56:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:56:59,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:56:59,025 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:56:59,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 18:56:59,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:59,248 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:56:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:56:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 705219706, now seen corresponding path program 18 times [2022-03-15 18:56:59,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:56:59,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462050814] [2022-03-15 18:56:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:56:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:56:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:56:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:59,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:56:59,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462050814] [2022-03-15 18:56:59,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462050814] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:56:59,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117606747] [2022-03-15 18:56:59,370 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:56:59,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:56:59,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:56:59,371 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:56:59,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 18:56:59,454 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 18:56:59,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:56:59,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:56:59,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:56:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:56:59,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:00,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117606747] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:00,579 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:00,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:00,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061005455] [2022-03-15 18:57:00,579 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:00,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:00,604 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 226 transitions. [2022-03-15 18:57:00,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:02,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [26133#(not (<= (mod ~v_assert~0 256) 0)), 26192#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 26193#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 26196#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 26191#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 26129#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 26194#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 26195#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 18:57:02,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 18:57:02,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:02,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 18:57:02,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:57:02,592 INFO L87 Difference]: Start difference. First operand 428 states and 1132 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:03,068 INFO L93 Difference]: Finished difference Result 570 states and 1465 transitions. [2022-03-15 18:57:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:57:03,068 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:03,070 INFO L225 Difference]: With dead ends: 570 [2022-03-15 18:57:03,070 INFO L226 Difference]: Without dead ends: 524 [2022-03-15 18:57:03,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=1763, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 18:57:03,071 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:03,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:57:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-15 18:57:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 412. [2022-03-15 18:57:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.6472019464720193) internal successors, (1088), 411 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1088 transitions. [2022-03-15 18:57:03,086 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1088 transitions. Word has length 28 [2022-03-15 18:57:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:03,086 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1088 transitions. [2022-03-15 18:57:03,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1088 transitions. [2022-03-15 18:57:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:03,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:03,088 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:03,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:03,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 18:57:03,304 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:03,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1611410197, now seen corresponding path program 19 times [2022-03-15 18:57:03,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:03,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505275500] [2022-03-15 18:57:03,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:03,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:03,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:03,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505275500] [2022-03-15 18:57:03,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505275500] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:03,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373072006] [2022-03-15 18:57:03,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:57:03,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:03,412 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:03,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 18:57:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:03,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:03,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:03,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:04,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373072006] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:04,663 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:04,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 18:57:04,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004286014] [2022-03-15 18:57:04,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:04,666 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:04,686 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 204 transitions. [2022-03-15 18:57:04,686 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:06,208 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [27749#(not (<= (mod ~v_assert~0 256) 0)), 27809#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 27745#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 27807#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0))), 27808#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0))), 27810#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:57:06,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:06,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:06,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:57:06,210 INFO L87 Difference]: Start difference. First operand 412 states and 1088 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:06,799 INFO L93 Difference]: Finished difference Result 618 states and 1597 transitions. [2022-03-15 18:57:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:57:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:06,801 INFO L225 Difference]: With dead ends: 618 [2022-03-15 18:57:06,801 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 18:57:06,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 89 SyntacticMatches, 25 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 18:57:06,802 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 165 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:06,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 8 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:57:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 18:57:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 412. [2022-03-15 18:57:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.6472019464720193) internal successors, (1088), 411 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1088 transitions. [2022-03-15 18:57:06,810 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1088 transitions. Word has length 28 [2022-03-15 18:57:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:06,810 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1088 transitions. [2022-03-15 18:57:06,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1088 transitions. [2022-03-15 18:57:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:06,810 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:06,811 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:06,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:07,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 18:57:07,027 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1031261892, now seen corresponding path program 20 times [2022-03-15 18:57:07,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:07,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584080536] [2022-03-15 18:57:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:07,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:07,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584080536] [2022-03-15 18:57:07,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584080536] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:07,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086729663] [2022-03-15 18:57:07,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:57:07,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:07,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:07,143 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:07,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 18:57:07,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:57:07,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:07,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:07,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:07,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:08,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086729663] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:08,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:08,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 18:57:08,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289915163] [2022-03-15 18:57:08,265 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:08,268 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:08,287 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 204 transitions. [2022-03-15 18:57:08,287 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:09,343 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [29475#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 29417#(not (<= (mod ~v_assert~0 256) 0)), 29474#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 29413#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 18:57:09,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:57:09,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:09,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:57:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:57:09,344 INFO L87 Difference]: Start difference. First operand 412 states and 1088 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:09,689 INFO L93 Difference]: Finished difference Result 578 states and 1506 transitions. [2022-03-15 18:57:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:57:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:09,691 INFO L225 Difference]: With dead ends: 578 [2022-03-15 18:57:09,691 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 18:57:09,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 104 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1276, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:57:09,692 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 149 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:09,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 9 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 18:57:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 428. [2022-03-15 18:57:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.651053864168618) internal successors, (1132), 427 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1132 transitions. [2022-03-15 18:57:09,698 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1132 transitions. Word has length 28 [2022-03-15 18:57:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:09,699 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1132 transitions. [2022-03-15 18:57:09,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1132 transitions. [2022-03-15 18:57:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:09,700 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:09,700 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:09,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:09,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 18:57:09,911 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:09,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1937275543, now seen corresponding path program 21 times [2022-03-15 18:57:09,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:09,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553384529] [2022-03-15 18:57:09,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:10,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:10,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553384529] [2022-03-15 18:57:10,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553384529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:10,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142992093] [2022-03-15 18:57:10,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:57:10,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:10,047 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 18:57:10,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 18:57:10,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:10,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:10,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:10,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:11,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142992093] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:11,340 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:11,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-03-15 18:57:11,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541205258] [2022-03-15 18:57:11,340 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:11,348 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:11,370 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 226 transitions. [2022-03-15 18:57:11,370 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:13,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [31126#(and (or (<= ~c2~0 (+ ~pos~0 1)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 31127#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c2~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 31068#(not (<= (mod ~v_assert~0 256) 0)), 31125#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) ~pos~0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (<= ~c2~0 (+ ~pos~0 1)) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0))), 31128#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c2~0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 31064#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 18:57:13,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:13,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:13,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:13,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:57:13,522 INFO L87 Difference]: Start difference. First operand 428 states and 1132 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:14,014 INFO L93 Difference]: Finished difference Result 586 states and 1509 transitions. [2022-03-15 18:57:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:57:14,015 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:14,016 INFO L225 Difference]: With dead ends: 586 [2022-03-15 18:57:14,016 INFO L226 Difference]: Without dead ends: 540 [2022-03-15 18:57:14,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 114 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=1340, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:57:14,017 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 156 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:14,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 9 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:57:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-03-15 18:57:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 428. [2022-03-15 18:57:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.651053864168618) internal successors, (1132), 427 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1132 transitions. [2022-03-15 18:57:14,023 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1132 transitions. Word has length 28 [2022-03-15 18:57:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:14,023 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1132 transitions. [2022-03-15 18:57:14,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1132 transitions. [2022-03-15 18:57:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:14,024 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:14,024 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:14,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:14,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:14,235 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2057911655, now seen corresponding path program 22 times [2022-03-15 18:57:14,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:14,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561406252] [2022-03-15 18:57:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:14,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:14,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561406252] [2022-03-15 18:57:14,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561406252] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:14,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930575856] [2022-03-15 18:57:14,337 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:57:14,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:14,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:14,338 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:14,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 18:57:14,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:57:14,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:14,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:14,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:14,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:15,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930575856] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:15,582 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:15,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:15,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1920570360] [2022-03-15 18:57:15,582 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:15,585 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:15,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 226 transitions. [2022-03-15 18:57:15,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:16,904 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [32787#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 32724#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 32728#(not (<= (mod ~v_assert~0 256) 0)), 32786#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 18:57:16,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:57:16,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:57:16,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:57:16,906 INFO L87 Difference]: Start difference. First operand 428 states and 1132 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:17,176 INFO L93 Difference]: Finished difference Result 554 states and 1440 transitions. [2022-03-15 18:57:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:57:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:17,179 INFO L225 Difference]: With dead ends: 554 [2022-03-15 18:57:17,179 INFO L226 Difference]: Without dead ends: 508 [2022-03-15 18:57:17,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 97 SyntacticMatches, 26 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:57:17,186 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 98 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:17,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 8 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-03-15 18:57:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 412. [2022-03-15 18:57:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.6472019464720193) internal successors, (1088), 411 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1088 transitions. [2022-03-15 18:57:17,214 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1088 transitions. Word has length 28 [2022-03-15 18:57:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:17,214 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1088 transitions. [2022-03-15 18:57:17,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1088 transitions. [2022-03-15 18:57:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:17,215 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:17,215 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:17,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:17,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 18:57:17,416 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash 542789599, now seen corresponding path program 23 times [2022-03-15 18:57:17,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:17,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889387206] [2022-03-15 18:57:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:17,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:17,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889387206] [2022-03-15 18:57:17,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889387206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:17,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115425789] [2022-03-15 18:57:17,527 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:57:17,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:17,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:17,528 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:17,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 18:57:17,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 18:57:17,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:17,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:17,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:17,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:18,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115425789] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:18,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:18,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:18,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246809332] [2022-03-15 18:57:18,483 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:18,485 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:18,503 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 152 transitions. [2022-03-15 18:57:18,503 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:19,155 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [34317#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 34321#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:57:19,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:57:19,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:57:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:57:19,156 INFO L87 Difference]: Start difference. First operand 412 states and 1088 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:19,429 INFO L93 Difference]: Finished difference Result 506 states and 1327 transitions. [2022-03-15 18:57:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 18:57:19,429 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:19,431 INFO L225 Difference]: With dead ends: 506 [2022-03-15 18:57:19,431 INFO L226 Difference]: Without dead ends: 460 [2022-03-15 18:57:19,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 18:57:19,434 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:19,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-03-15 18:57:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 412. [2022-03-15 18:57:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.6472019464720193) internal successors, (1088), 411 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1088 transitions. [2022-03-15 18:57:19,450 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1088 transitions. Word has length 28 [2022-03-15 18:57:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:19,451 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1088 transitions. [2022-03-15 18:57:19,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1088 transitions. [2022-03-15 18:57:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:19,452 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:19,452 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:19,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:19,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:19,652 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash -483860164, now seen corresponding path program 24 times [2022-03-15 18:57:19,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:19,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638264658] [2022-03-15 18:57:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:19,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:19,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638264658] [2022-03-15 18:57:19,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638264658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:19,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355512994] [2022-03-15 18:57:19,781 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:57:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:19,782 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:19,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 18:57:19,879 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 18:57:19,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:19,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:19,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:20,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:21,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355512994] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:21,228 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:21,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:21,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1274084436] [2022-03-15 18:57:21,229 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:21,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:21,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 218 transitions. [2022-03-15 18:57:21,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:23,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [35926#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 35925#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 35924#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 35923#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 35922#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 35852#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:57:23,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:23,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:23,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:57:23,499 INFO L87 Difference]: Start difference. First operand 412 states and 1088 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:24,249 INFO L93 Difference]: Finished difference Result 642 states and 1670 transitions. [2022-03-15 18:57:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:57:24,249 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:24,251 INFO L225 Difference]: With dead ends: 642 [2022-03-15 18:57:24,251 INFO L226 Difference]: Without dead ends: 548 [2022-03-15 18:57:24,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 91 SyntacticMatches, 25 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 18:57:24,253 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:24,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:57:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-03-15 18:57:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 444. [2022-03-15 18:57:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 2.654627539503386) internal successors, (1176), 443 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1176 transitions. [2022-03-15 18:57:24,278 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1176 transitions. Word has length 28 [2022-03-15 18:57:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:24,279 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1176 transitions. [2022-03-15 18:57:24,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1176 transitions. [2022-03-15 18:57:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:24,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:24,279 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:24,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:24,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-15 18:57:24,480 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:24,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash 122550229, now seen corresponding path program 25 times [2022-03-15 18:57:24,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:24,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886397035] [2022-03-15 18:57:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:24,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:24,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886397035] [2022-03-15 18:57:24,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886397035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:24,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296713252] [2022-03-15 18:57:24,598 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:57:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:24,599 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:24,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 18:57:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:24,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:24,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:25,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:25,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296713252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:25,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:25,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:25,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812676824] [2022-03-15 18:57:25,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:25,886 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:25,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 196 transitions. [2022-03-15 18:57:25,909 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:27,636 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [37688#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 37689#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 37691#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 37626#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 37630#(not (<= (mod ~v_assert~0 256) 0)), 37690#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:57:27,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:27,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:57:27,637 INFO L87 Difference]: Start difference. First operand 444 states and 1176 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:28,323 INFO L93 Difference]: Finished difference Result 618 states and 1616 transitions. [2022-03-15 18:57:28,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:57:28,323 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:28,325 INFO L225 Difference]: With dead ends: 618 [2022-03-15 18:57:28,325 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 18:57:28,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 91 SyntacticMatches, 18 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=421, Invalid=1931, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 18:57:28,326 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:28,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:57:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 18:57:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 444. [2022-03-15 18:57:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 2.654627539503386) internal successors, (1176), 443 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1176 transitions. [2022-03-15 18:57:28,343 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1176 transitions. Word has length 28 [2022-03-15 18:57:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:28,343 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1176 transitions. [2022-03-15 18:57:28,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1176 transitions. [2022-03-15 18:57:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:28,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:28,344 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:28,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:28,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:28,545 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1774845436, now seen corresponding path program 26 times [2022-03-15 18:57:28,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:28,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354592543] [2022-03-15 18:57:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:28,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:28,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354592543] [2022-03-15 18:57:28,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354592543] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:28,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780045761] [2022-03-15 18:57:28,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:57:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:28,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:28,692 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:28,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 18:57:28,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:57:28,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:28,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:28,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:29,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:30,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780045761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:30,219 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:30,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:30,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1687993089] [2022-03-15 18:57:30,219 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:30,222 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:30,241 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 196 transitions. [2022-03-15 18:57:30,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:31,801 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [39427#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 39355#(not (<= (mod ~v_assert~0 256) 0)), 39426#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 39425#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))))] [2022-03-15 18:57:31,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:57:31,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:57:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:57:31,803 INFO L87 Difference]: Start difference. First operand 444 states and 1176 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:32,216 INFO L93 Difference]: Finished difference Result 578 states and 1506 transitions. [2022-03-15 18:57:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:57:32,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:32,245 INFO L225 Difference]: With dead ends: 578 [2022-03-15 18:57:32,245 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 18:57:32,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 18:57:32,246 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 122 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:32,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 8 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 18:57:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 460. [2022-03-15 18:57:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.657952069716776) internal successors, (1220), 459 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1220 transitions. [2022-03-15 18:57:32,252 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1220 transitions. Word has length 28 [2022-03-15 18:57:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:32,252 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1220 transitions. [2022-03-15 18:57:32,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1220 transitions. [2022-03-15 18:57:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:32,253 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:32,253 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:32,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:32,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:32,467 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:32,468 INFO L85 PathProgramCache]: Analyzing trace with hash 448415575, now seen corresponding path program 27 times [2022-03-15 18:57:32,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:32,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963922560] [2022-03-15 18:57:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:32,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:32,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963922560] [2022-03-15 18:57:32,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963922560] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:32,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698967151] [2022-03-15 18:57:32,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:57:32,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:32,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:32,569 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:32,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 18:57:32,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 18:57:32,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:32,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:32,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:33,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:34,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698967151] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:34,014 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:34,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:34,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2109536102] [2022-03-15 18:57:34,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:34,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:34,038 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 218 transitions. [2022-03-15 18:57:34,038 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:35,668 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [41147#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 41149#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 41148#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 41145#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 41075#(not (<= (mod ~v_assert~0 256) 0)), 41146#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:57:35,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:35,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:35,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:35,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:57:35,670 INFO L87 Difference]: Start difference. First operand 460 states and 1220 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:36,095 INFO L93 Difference]: Finished difference Result 650 states and 1685 transitions. [2022-03-15 18:57:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:57:36,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:36,098 INFO L225 Difference]: With dead ends: 650 [2022-03-15 18:57:36,098 INFO L226 Difference]: Without dead ends: 604 [2022-03-15 18:57:36,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 94 SyntacticMatches, 22 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=1797, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:57:36,098 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 164 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:36,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 8 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-03-15 18:57:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 460. [2022-03-15 18:57:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.657952069716776) internal successors, (1220), 459 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1220 transitions. [2022-03-15 18:57:36,104 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1220 transitions. Word has length 28 [2022-03-15 18:57:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:36,104 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1220 transitions. [2022-03-15 18:57:36,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1220 transitions. [2022-03-15 18:57:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:36,105 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:36,105 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:36,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:36,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:36,321 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:36,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash 748195673, now seen corresponding path program 28 times [2022-03-15 18:57:36,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:36,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364999389] [2022-03-15 18:57:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:36,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:36,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364999389] [2022-03-15 18:57:36,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364999389] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:36,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041528385] [2022-03-15 18:57:36,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:57:36,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:36,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:36,450 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:36,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 18:57:36,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:57:36,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:36,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:36,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:36,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:37,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041528385] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:37,809 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:37,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:37,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [453866372] [2022-03-15 18:57:37,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:37,812 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:37,833 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 218 transitions. [2022-03-15 18:57:37,833 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:39,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [42883#(not (<= (mod ~v_assert~0 256) 0)), 42941#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 42879#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 42942#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:57:39,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:57:39,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:57:39,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:57:39,444 INFO L87 Difference]: Start difference. First operand 460 states and 1220 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:39,844 INFO L93 Difference]: Finished difference Result 586 states and 1528 transitions. [2022-03-15 18:57:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 18:57:39,844 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:39,846 INFO L225 Difference]: With dead ends: 586 [2022-03-15 18:57:39,846 INFO L226 Difference]: Without dead ends: 540 [2022-03-15 18:57:39,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 18:57:39,847 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:39,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 6 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-03-15 18:57:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 444. [2022-03-15 18:57:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 2.654627539503386) internal successors, (1176), 443 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1176 transitions. [2022-03-15 18:57:39,852 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 1176 transitions. Word has length 28 [2022-03-15 18:57:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:39,852 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 1176 transitions. [2022-03-15 18:57:39,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 1176 transitions. [2022-03-15 18:57:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:39,853 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:39,853 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:39,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:40,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 18:57:40,054 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash -862524740, now seen corresponding path program 29 times [2022-03-15 18:57:40,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:40,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446731860] [2022-03-15 18:57:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:40,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:40,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446731860] [2022-03-15 18:57:40,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446731860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:40,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258503223] [2022-03-15 18:57:40,164 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:57:40,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:40,165 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:40,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 18:57:40,275 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 18:57:40,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:40,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:40,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:40,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:41,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258503223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:41,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:41,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:41,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131148596] [2022-03-15 18:57:41,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:41,565 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:41,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 174 transitions. [2022-03-15 18:57:41,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:42,567 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [44568#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 44572#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:57:42,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:57:42,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:57:42,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2022-03-15 18:57:42,568 INFO L87 Difference]: Start difference. First operand 444 states and 1176 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:42,899 INFO L93 Difference]: Finished difference Result 546 states and 1437 transitions. [2022-03-15 18:57:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:57:42,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:42,901 INFO L225 Difference]: With dead ends: 546 [2022-03-15 18:57:42,901 INFO L226 Difference]: Without dead ends: 500 [2022-03-15 18:57:42,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 91 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:57:42,902 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:42,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-03-15 18:57:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 468. [2022-03-15 18:57:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.6595289079229123) internal successors, (1242), 467 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1242 transitions. [2022-03-15 18:57:42,924 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1242 transitions. Word has length 28 [2022-03-15 18:57:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:42,924 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1242 transitions. [2022-03-15 18:57:42,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1242 transitions. [2022-03-15 18:57:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:42,926 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:42,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:42,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:43,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 18:57:43,155 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2106012695, now seen corresponding path program 30 times [2022-03-15 18:57:43,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:43,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682144913] [2022-03-15 18:57:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:43,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:43,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682144913] [2022-03-15 18:57:43,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682144913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:43,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661261216] [2022-03-15 18:57:43,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:57:43,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:43,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:43,261 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:43,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 18:57:43,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 18:57:43,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:43,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:43,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:43,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:44,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661261216] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:44,980 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:44,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:44,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960314663] [2022-03-15 18:57:44,980 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:44,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:45,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 218 transitions. [2022-03-15 18:57:45,005 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:47,480 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [46334#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 46331#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 46333#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 46261#(not (<= (mod ~v_assert~0 256) 0)), 46332#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 46335#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)))] [2022-03-15 18:57:47,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 18:57:47,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:47,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 18:57:47,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:57:47,482 INFO L87 Difference]: Start difference. First operand 468 states and 1242 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:48,189 INFO L93 Difference]: Finished difference Result 634 states and 1660 transitions. [2022-03-15 18:57:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:57:48,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:48,191 INFO L225 Difference]: With dead ends: 634 [2022-03-15 18:57:48,192 INFO L226 Difference]: Without dead ends: 588 [2022-03-15 18:57:48,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=2101, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 18:57:48,193 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:48,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-03-15 18:57:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 484. [2022-03-15 18:57:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 2.6625258799171845) internal successors, (1286), 483 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1286 transitions. [2022-03-15 18:57:48,213 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1286 transitions. Word has length 28 [2022-03-15 18:57:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:48,213 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 1286 transitions. [2022-03-15 18:57:48,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1286 transitions. [2022-03-15 18:57:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:48,214 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:48,214 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:48,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:48,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:48,430 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1889174503, now seen corresponding path program 31 times [2022-03-15 18:57:48,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:48,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030609702] [2022-03-15 18:57:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:48,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:48,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030609702] [2022-03-15 18:57:48,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030609702] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:48,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804993801] [2022-03-15 18:57:48,529 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:57:48,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:48,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:48,530 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:48,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 18:57:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:48,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:48,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:48,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:49,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804993801] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:49,944 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:49,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 18:57:49,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1737585400] [2022-03-15 18:57:49,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:49,948 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:49,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 218 transitions. [2022-03-15 18:57:49,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:51,279 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [48167#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 48104#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 48108#(not (<= (mod ~v_assert~0 256) 0)), 48166#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0)))] [2022-03-15 18:57:51,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 18:57:51,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:51,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 18:57:51,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:57:51,280 INFO L87 Difference]: Start difference. First operand 484 states and 1286 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:51,577 INFO L93 Difference]: Finished difference Result 618 states and 1616 transitions. [2022-03-15 18:57:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:57:51,577 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:51,579 INFO L225 Difference]: With dead ends: 618 [2022-03-15 18:57:51,579 INFO L226 Difference]: Without dead ends: 572 [2022-03-15 18:57:51,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 111 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=294, Invalid=1346, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:57:51,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:51,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 1 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-03-15 18:57:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 484. [2022-03-15 18:57:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 2.6625258799171845) internal successors, (1286), 483 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1286 transitions. [2022-03-15 18:57:51,594 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1286 transitions. Word has length 28 [2022-03-15 18:57:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:51,594 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 1286 transitions. [2022-03-15 18:57:51,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1286 transitions. [2022-03-15 18:57:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:51,595 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:51,595 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:51,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:51,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 18:57:51,822 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash 369531097, now seen corresponding path program 32 times [2022-03-15 18:57:51,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:51,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640864209] [2022-03-15 18:57:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:51,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:51,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640864209] [2022-03-15 18:57:51,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640864209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:51,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212126230] [2022-03-15 18:57:51,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:57:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:51,930 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:51,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 18:57:52,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:57:52,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:52,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:52,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:52,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:53,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212126230] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:53,261 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:53,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:53,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746235831] [2022-03-15 18:57:53,261 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:53,264 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:53,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 196 transitions. [2022-03-15 18:57:53,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:54,667 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [49901#(not (<= (mod ~v_assert~0 256) 0)), 49971#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:57:54,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:57:54,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:57:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:57:54,667 INFO L87 Difference]: Start difference. First operand 484 states and 1286 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:55,073 INFO L93 Difference]: Finished difference Result 602 states and 1591 transitions. [2022-03-15 18:57:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 18:57:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:55,075 INFO L225 Difference]: With dead ends: 602 [2022-03-15 18:57:55,075 INFO L226 Difference]: Without dead ends: 556 [2022-03-15 18:57:55,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 89 SyntacticMatches, 23 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 18:57:55,075 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:55,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-03-15 18:57:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 492. [2022-03-15 18:57:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.663951120162933) internal successors, (1308), 491 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1308 transitions. [2022-03-15 18:57:55,081 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1308 transitions. Word has length 28 [2022-03-15 18:57:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:55,081 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1308 transitions. [2022-03-15 18:57:55,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1308 transitions. [2022-03-15 18:57:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:55,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:55,082 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:55,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:55,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 18:57:55,301 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash -657118666, now seen corresponding path program 33 times [2022-03-15 18:57:55,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:55,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529816452] [2022-03-15 18:57:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:55,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:55,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529816452] [2022-03-15 18:57:55,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529816452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:55,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942333727] [2022-03-15 18:57:55,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:57:55,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:55,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:55,420 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:55,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 18:57:55,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 18:57:55,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:55,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:55,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:55,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:56,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942333727] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:56,596 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:56,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 18:57:56,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700913470] [2022-03-15 18:57:56,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:56,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:56,619 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 218 transitions. [2022-03-15 18:57:56,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:57:58,273 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [51775#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 51705#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:57:58,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:57:58,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:57:58,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:57:58,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-03-15 18:57:58,274 INFO L87 Difference]: Start difference. First operand 492 states and 1308 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:57:58,666 INFO L93 Difference]: Finished difference Result 578 states and 1525 transitions. [2022-03-15 18:57:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:57:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 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 28 [2022-03-15 18:57:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:57:58,668 INFO L225 Difference]: With dead ends: 578 [2022-03-15 18:57:58,668 INFO L226 Difference]: Without dead ends: 532 [2022-03-15 18:57:58,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 87 SyntacticMatches, 33 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1394, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 18:57:58,669 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:57:58,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:57:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-03-15 18:57:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 484. [2022-03-15 18:57:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 2.6625258799171845) internal successors, (1286), 483 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1286 transitions. [2022-03-15 18:57:58,674 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1286 transitions. Word has length 28 [2022-03-15 18:57:58,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:57:58,674 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 1286 transitions. [2022-03-15 18:57:58,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:57:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1286 transitions. [2022-03-15 18:57:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 18:57:58,675 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:57:58,675 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:57:58,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 18:57:58,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 18:57:58,890 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:57:58,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:57:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 372143037, now seen corresponding path program 4 times [2022-03-15 18:57:58,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:57:58,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990867103] [2022-03-15 18:57:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:57:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:57:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:57:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:59,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:57:59,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990867103] [2022-03-15 18:57:59,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990867103] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:57:59,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782963275] [2022-03-15 18:57:59,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:57:59,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:57:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:57:59,028 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:57:59,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 18:57:59,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:57:59,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:57:59,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-15 18:57:59,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:57:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:59,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:57:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:57:59,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782963275] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:57:59,885 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:57:59,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 18:57:59,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768974852] [2022-03-15 18:57:59,885 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:57:59,888 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:57:59,903 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 126 transitions. [2022-03-15 18:57:59,903 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:00,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [53478#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 53482#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:58:00,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 18:58:00,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 18:58:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-03-15 18:58:00,423 INFO L87 Difference]: Start difference. First operand 484 states and 1286 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:00,701 INFO L93 Difference]: Finished difference Result 568 states and 1496 transitions. [2022-03-15 18:58:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:58:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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 28 [2022-03-15 18:58:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:00,710 INFO L225 Difference]: With dead ends: 568 [2022-03-15 18:58:00,710 INFO L226 Difference]: Without dead ends: 516 [2022-03-15 18:58:00,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=322, Invalid=1400, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 18:58:00,711 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:00,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:58:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-03-15 18:58:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 492. [2022-03-15 18:58:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 2.663951120162933) internal successors, (1308), 491 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1308 transitions. [2022-03-15 18:58:00,717 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1308 transitions. Word has length 28 [2022-03-15 18:58:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:00,717 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 1308 transitions. [2022-03-15 18:58:00,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1308 transitions. [2022-03-15 18:58:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:00,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:00,718 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:00,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:00,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:00,935 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash -524495951, now seen corresponding path program 34 times [2022-03-15 18:58:00,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:00,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735421380] [2022-03-15 18:58:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:01,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:01,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735421380] [2022-03-15 18:58:01,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735421380] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:01,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640600483] [2022-03-15 18:58:01,077 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:58:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:01,078 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:01,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 18:58:01,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:58:01,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:01,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:01,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:01,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:02,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640600483] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:02,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:02,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:58:02,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556101360] [2022-03-15 18:58:02,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:02,803 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:02,833 INFO L252 McrAutomatonBuilder]: Finished intersection with 144 states and 290 transitions. [2022-03-15 18:58:02,833 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:06,999 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [55329#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)))), 55333#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 55337#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (<= (+ ~c1~0 4) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 6)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 55331#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 55332#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 55261#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 55334#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 55335#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ 5 ~pos~0)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0))), 55265#(not (<= (mod ~v_assert~0 256) 0)), 55338#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= 0 (+ ~pos~0 4)) (<= (+ ~c1~0 4) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 6)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 55330#(and (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 55336#(and (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 3)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ 5 ~pos~0)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:58:06,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 18:58:06,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 18:58:06,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:58:06,999 INFO L87 Difference]: Start difference. First operand 492 states and 1308 transitions. Second operand has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:08,619 INFO L93 Difference]: Finished difference Result 872 states and 2173 transitions. [2022-03-15 18:58:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 18:58:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:08,622 INFO L225 Difference]: With dead ends: 872 [2022-03-15 18:58:08,622 INFO L226 Difference]: Without dead ends: 826 [2022-03-15 18:58:08,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 106 SyntacticMatches, 40 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=873, Invalid=3683, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 18:58:08,623 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 562 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:08,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 0 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:58:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-03-15 18:58:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 560. [2022-03-15 18:58:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.701252236135957) internal successors, (1510), 559 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1510 transitions. [2022-03-15 18:58:08,634 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1510 transitions. Word has length 30 [2022-03-15 18:58:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:08,634 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 1510 transitions. [2022-03-15 18:58:08,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.304347826086956) internal successors, (99), 22 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1510 transitions. [2022-03-15 18:58:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:08,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:08,635 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:08,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:08,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:08,844 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1022496755, now seen corresponding path program 35 times [2022-03-15 18:58:08,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:08,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137421347] [2022-03-15 18:58:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:09,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:09,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137421347] [2022-03-15 18:58:09,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137421347] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:09,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622398618] [2022-03-15 18:58:09,005 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:58:09,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:09,006 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:09,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 18:58:09,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 18:58:09,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:09,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 18:58:09,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:09,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:11,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622398618] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:11,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:11,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2022-03-15 18:58:11,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [348642141] [2022-03-15 18:58:11,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:11,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:11,176 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 256 transitions. [2022-03-15 18:58:11,176 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:12,944 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [57528#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 57600#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 57532#(not (<= (mod ~v_assert~0 256) 0)), 57602#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 57599#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 57603#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 57601#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 57598#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 18:58:12,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:58:12,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:58:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 18:58:12,945 INFO L87 Difference]: Start difference. First operand 560 states and 1510 transitions. Second operand has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:13,579 INFO L93 Difference]: Finished difference Result 800 states and 2119 transitions. [2022-03-15 18:58:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:58:13,579 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:13,587 INFO L225 Difference]: With dead ends: 800 [2022-03-15 18:58:13,587 INFO L226 Difference]: Without dead ends: 720 [2022-03-15 18:58:13,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 120 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=557, Invalid=2635, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 18:58:13,588 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:13,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-03-15 18:58:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 544. [2022-03-15 18:58:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 2.685082872928177) internal successors, (1458), 543 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1458 transitions. [2022-03-15 18:58:13,595 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1458 transitions. Word has length 30 [2022-03-15 18:58:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:13,595 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1458 transitions. [2022-03-15 18:58:13,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.421052631578948) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1458 transitions. [2022-03-15 18:58:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:13,596 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:13,596 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:13,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:13,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-15 18:58:13,800 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1606421683, now seen corresponding path program 36 times [2022-03-15 18:58:13,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:13,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753614593] [2022-03-15 18:58:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:13,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:13,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753614593] [2022-03-15 18:58:13,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753614593] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:13,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171273423] [2022-03-15 18:58:13,967 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:58:13,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:13,988 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:14,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 18:58:14,136 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 18:58:14,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:14,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:14,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:14,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:15,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171273423] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:15,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:15,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:58:15,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286444268] [2022-03-15 18:58:15,962 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:15,964 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:15,990 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 226 transitions. [2022-03-15 18:58:15,990 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:18,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [59734#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 59732#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 59735#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 59733#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 59665#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 59669#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:58:18,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:58:18,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:18,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:58:18,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:18,215 INFO L87 Difference]: Start difference. First operand 544 states and 1458 transitions. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:18,914 INFO L93 Difference]: Finished difference Result 766 states and 2030 transitions. [2022-03-15 18:58:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:58:18,915 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:18,916 INFO L225 Difference]: With dead ends: 766 [2022-03-15 18:58:18,916 INFO L226 Difference]: Without dead ends: 720 [2022-03-15 18:58:18,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 88 SyntacticMatches, 39 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=1879, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 18:58:18,917 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:18,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-03-15 18:58:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 592. [2022-03-15 18:58:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 2.6903553299492384) internal successors, (1590), 591 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1590 transitions. [2022-03-15 18:58:18,924 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1590 transitions. Word has length 30 [2022-03-15 18:58:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:18,924 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 1590 transitions. [2022-03-15 18:58:18,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1590 transitions. [2022-03-15 18:58:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:18,925 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:18,925 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:18,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-03-15 18:58:19,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 18:58:19,133 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:19,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash 279991822, now seen corresponding path program 37 times [2022-03-15 18:58:19,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:19,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560059052] [2022-03-15 18:58:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:19,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:19,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560059052] [2022-03-15 18:58:19,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560059052] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:19,241 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54005267] [2022-03-15 18:58:19,241 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:58:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:19,242 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:19,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 18:58:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:19,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:19,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:19,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:20,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54005267] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:20,739 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:20,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:58:20,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555596261] [2022-03-15 18:58:20,739 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:20,742 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:20,770 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 270 transitions. [2022-03-15 18:58:20,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:22,931 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [61926#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 61855#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 61859#(not (<= (mod ~v_assert~0 256) 0)), 61925#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 61928#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 61929#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 61930#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 61927#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 61923#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 61924#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)))] [2022-03-15 18:58:22,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:58:22,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:58:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:58:22,932 INFO L87 Difference]: Start difference. First operand 592 states and 1590 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:23,582 INFO L93 Difference]: Finished difference Result 854 states and 2253 transitions. [2022-03-15 18:58:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:58:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 18:58:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:23,584 INFO L225 Difference]: With dead ends: 854 [2022-03-15 18:58:23,584 INFO L226 Difference]: Without dead ends: 808 [2022-03-15 18:58:23,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 106 SyntacticMatches, 32 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 18:58:23,585 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:23,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-03-15 18:58:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 608. [2022-03-15 18:58:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 2.6919275123558486) internal successors, (1634), 607 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1634 transitions. [2022-03-15 18:58:23,592 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1634 transitions. Word has length 30 [2022-03-15 18:58:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:23,592 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 1634 transitions. [2022-03-15 18:58:23,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1634 transitions. [2022-03-15 18:58:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:23,593 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:23,593 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:23,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:23,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 18:58:23,806 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1811827757, now seen corresponding path program 38 times [2022-03-15 18:58:23,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:23,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292809725] [2022-03-15 18:58:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:23,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:23,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292809725] [2022-03-15 18:58:23,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292809725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:23,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783562375] [2022-03-15 18:58:23,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:58:23,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:23,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:23,930 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:23,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 18:58:24,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:58:24,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:24,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:24,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:24,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:26,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783562375] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:26,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:26,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:58:26,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1937585918] [2022-03-15 18:58:26,108 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:26,111 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:26,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 270 transitions. [2022-03-15 18:58:26,139 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:28,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [64182#(not (<= (mod ~v_assert~0 256) 0)), 64247#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 64248#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 64178#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 64245#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 64246#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 18:58:28,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:58:28,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:58:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:28,007 INFO L87 Difference]: Start difference. First operand 608 states and 1634 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:28,824 INFO L93 Difference]: Finished difference Result 926 states and 2422 transitions. [2022-03-15 18:58:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 18:58:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:28,826 INFO L225 Difference]: With dead ends: 926 [2022-03-15 18:58:28,826 INFO L226 Difference]: Without dead ends: 880 [2022-03-15 18:58:28,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 131 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=444, Invalid=2418, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 18:58:28,828 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:28,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-03-15 18:58:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 640. [2022-03-15 18:58:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 2.70735524256651) internal successors, (1730), 639 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1730 transitions. [2022-03-15 18:58:28,836 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1730 transitions. Word has length 30 [2022-03-15 18:58:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:28,836 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 1730 transitions. [2022-03-15 18:58:28,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1730 transitions. [2022-03-15 18:58:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:28,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:28,837 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:28,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:29,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 18:58:29,053 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1424604994, now seen corresponding path program 39 times [2022-03-15 18:58:29,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:29,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712111845] [2022-03-15 18:58:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:29,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:29,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712111845] [2022-03-15 18:58:29,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712111845] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:29,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876567202] [2022-03-15 18:58:29,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:58:29,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:29,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:29,168 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:29,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 18:58:29,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 18:58:29,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:29,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:29,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:29,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:31,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876567202] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:31,007 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:31,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:58:31,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656960959] [2022-03-15 18:58:31,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:31,010 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:31,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 108 states and 200 transitions. [2022-03-15 18:58:31,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:32,508 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [66706#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 66635#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 66705#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 66703#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0))), 66704#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 66639#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:58:32,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:58:32,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:58:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:32,508 INFO L87 Difference]: Start difference. First operand 640 states and 1730 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:32,955 INFO L93 Difference]: Finished difference Result 854 states and 2280 transitions. [2022-03-15 18:58:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:58:32,955 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:32,956 INFO L225 Difference]: With dead ends: 854 [2022-03-15 18:58:32,956 INFO L226 Difference]: Without dead ends: 808 [2022-03-15 18:58:32,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 102 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=389, Invalid=1963, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 18:58:32,957 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:32,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:58:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-03-15 18:58:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 624. [2022-03-15 18:58:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 2.706260032102729) internal successors, (1686), 623 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1686 transitions. [2022-03-15 18:58:32,964 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1686 transitions. Word has length 30 [2022-03-15 18:58:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:32,964 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 1686 transitions. [2022-03-15 18:58:32,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1686 transitions. [2022-03-15 18:58:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:32,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:32,965 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:32,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:33,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:33,181 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash 117561715, now seen corresponding path program 40 times [2022-03-15 18:58:33,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:33,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117888053] [2022-03-15 18:58:33,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:33,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:33,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:33,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117888053] [2022-03-15 18:58:33,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117888053] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:33,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380097588] [2022-03-15 18:58:33,313 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:58:33,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:33,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:33,314 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:33,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 18:58:33,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:58:33,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:33,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:33,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:33,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:34,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380097588] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:34,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:34,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:58:34,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734997207] [2022-03-15 18:58:34,704 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:34,707 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:34,730 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 196 transitions. [2022-03-15 18:58:34,730 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:35,710 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [68980#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 69047#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c1~0))), 68984#(not (<= (mod ~v_assert~0 256) 0)), 69048#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:58:35,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:58:35,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:35,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:58:35,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:58:35,711 INFO L87 Difference]: Start difference. First operand 624 states and 1686 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:36,086 INFO L93 Difference]: Finished difference Result 766 states and 2038 transitions. [2022-03-15 18:58:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:58:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:36,100 INFO L225 Difference]: With dead ends: 766 [2022-03-15 18:58:36,100 INFO L226 Difference]: Without dead ends: 720 [2022-03-15 18:58:36,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 97 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=341, Invalid=1639, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 18:58:36,115 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 163 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:36,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 11 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:58:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-03-15 18:58:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 672. [2022-03-15 18:58:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.709388971684054) internal successors, (1818), 671 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1818 transitions. [2022-03-15 18:58:36,124 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1818 transitions. Word has length 30 [2022-03-15 18:58:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:36,124 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1818 transitions. [2022-03-15 18:58:36,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1818 transitions. [2022-03-15 18:58:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:36,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:36,125 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:36,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 18:58:36,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 18:58:36,326 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1208868146, now seen corresponding path program 41 times [2022-03-15 18:58:36,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:36,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669953886] [2022-03-15 18:58:36,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:36,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:36,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669953886] [2022-03-15 18:58:36,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669953886] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:36,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079330377] [2022-03-15 18:58:36,432 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:58:36,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:36,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:36,433 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:36,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 18:58:36,554 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 18:58:36,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:36,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:36,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:36,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:38,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079330377] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:38,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:38,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:58:38,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [446801992] [2022-03-15 18:58:38,363 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:38,366 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:38,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 262 transitions. [2022-03-15 18:58:38,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:40,697 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [71400#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 0 (+ ~c1~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 ~pos~0))), 71401#(and (or (< 0 (+ ~c1~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 71399#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 71394#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 71326#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 71395#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 71330#(not (<= (mod ~v_assert~0 256) 0)), 71398#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 71397#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 71396#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:58:40,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 18:58:40,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 18:58:40,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 18:58:40,701 INFO L87 Difference]: Start difference. First operand 672 states and 1818 transitions. Second operand has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:41,372 INFO L93 Difference]: Finished difference Result 894 states and 2371 transitions. [2022-03-15 18:58:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:58:41,373 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 18:58:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:41,374 INFO L225 Difference]: With dead ends: 894 [2022-03-15 18:58:41,374 INFO L226 Difference]: Without dead ends: 848 [2022-03-15 18:58:41,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=499, Invalid=2581, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 18:58:41,375 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 246 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:41,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 0 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-03-15 18:58:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 688. [2022-03-15 18:58:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.710334788937409) internal successors, (1862), 687 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1862 transitions. [2022-03-15 18:58:41,383 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1862 transitions. Word has length 30 [2022-03-15 18:58:41,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:41,383 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1862 transitions. [2022-03-15 18:58:41,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.666666666666667) internal successors, (98), 20 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1862 transitions. [2022-03-15 18:58:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:41,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:41,393 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:41,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:41,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 18:58:41,607 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash -909088048, now seen corresponding path program 42 times [2022-03-15 18:58:41,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:41,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072047695] [2022-03-15 18:58:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:41,725 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:41,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072047695] [2022-03-15 18:58:41,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072047695] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:41,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724060668] [2022-03-15 18:58:41,725 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:58:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:41,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:41,726 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:41,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 18:58:41,850 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 18:58:41,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:41,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:41,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:42,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:43,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724060668] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:43,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:43,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:58:43,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1266725840] [2022-03-15 18:58:43,725 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:43,727 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:43,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 262 transitions. [2022-03-15 18:58:43,756 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:45,796 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [73916#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 73915#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 73918#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 73847#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 73851#(not (<= (mod ~v_assert~0 256) 0)), 73917#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 73920#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 73919#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 18:58:45,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:58:45,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:58:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:58:45,796 INFO L87 Difference]: Start difference. First operand 688 states and 1862 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:46,359 INFO L93 Difference]: Finished difference Result 878 states and 2327 transitions. [2022-03-15 18:58:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:58:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:46,361 INFO L225 Difference]: With dead ends: 878 [2022-03-15 18:58:46,361 INFO L226 Difference]: Without dead ends: 832 [2022-03-15 18:58:46,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=355, Invalid=2095, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 18:58:46,361 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:46,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 0 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-03-15 18:58:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 672. [2022-03-15 18:58:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.709388971684054) internal successors, (1818), 671 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1818 transitions. [2022-03-15 18:58:46,370 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1818 transitions. Word has length 30 [2022-03-15 18:58:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:46,370 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1818 transitions. [2022-03-15 18:58:46,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1818 transitions. [2022-03-15 18:58:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:46,371 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:46,371 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:46,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:46,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 18:58:46,583 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash 322967789, now seen corresponding path program 43 times [2022-03-15 18:58:46,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:46,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967997894] [2022-03-15 18:58:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:46,723 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:46,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967997894] [2022-03-15 18:58:46,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967997894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:46,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426492076] [2022-03-15 18:58:46,723 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:58:46,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:46,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:46,724 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:46,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 18:58:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:46,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:46,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:47,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:48,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426492076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:48,653 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:48,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:58:48,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084331415] [2022-03-15 18:58:48,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:48,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:48,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 262 transitions. [2022-03-15 18:58:48,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:50,611 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [76309#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 76378#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 76380#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 76313#(not (<= (mod ~v_assert~0 256) 0)), 76379#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 76377#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))))] [2022-03-15 18:58:50,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:58:50,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:58:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:50,612 INFO L87 Difference]: Start difference. First operand 672 states and 1818 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:51,238 INFO L93 Difference]: Finished difference Result 918 states and 2437 transitions. [2022-03-15 18:58:51,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:58:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:51,240 INFO L225 Difference]: With dead ends: 918 [2022-03-15 18:58:51,240 INFO L226 Difference]: Without dead ends: 872 [2022-03-15 18:58:51,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 112 SyntacticMatches, 27 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=397, Invalid=1955, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 18:58:51,241 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 179 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:51,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 9 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:58:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2022-03-15 18:58:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 672. [2022-03-15 18:58:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.709388971684054) internal successors, (1818), 671 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1818 transitions. [2022-03-15 18:58:51,249 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1818 transitions. Word has length 30 [2022-03-15 18:58:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:51,249 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1818 transitions. [2022-03-15 18:58:51,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1818 transitions. [2022-03-15 18:58:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:51,250 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:51,250 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:51,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 18:58:51,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:51,467 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1980564909, now seen corresponding path program 44 times [2022-03-15 18:58:51,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:51,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644438624] [2022-03-15 18:58:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:51,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:51,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:51,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644438624] [2022-03-15 18:58:51,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644438624] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:51,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760130185] [2022-03-15 18:58:51,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:58:51,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:51,577 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:51,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 18:58:51,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:58:51,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:51,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:51,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:52,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:53,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760130185] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:53,187 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:53,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:58:53,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538126340] [2022-03-15 18:58:53,187 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:53,189 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:53,217 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 262 transitions. [2022-03-15 18:58:53,217 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:54,821 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [78883#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 78813#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 78881#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 78817#(not (<= (mod ~v_assert~0 256) 0)), 78882#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 78884#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:58:54,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:58:54,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:58:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:58:54,822 INFO L87 Difference]: Start difference. First operand 672 states and 1818 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:55,265 INFO L93 Difference]: Finished difference Result 894 states and 2371 transitions. [2022-03-15 18:58:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:58:55,266 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:55,267 INFO L225 Difference]: With dead ends: 894 [2022-03-15 18:58:55,267 INFO L226 Difference]: Without dead ends: 848 [2022-03-15 18:58:55,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 126 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=1787, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:58:55,269 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 152 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:55,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 8 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:58:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-03-15 18:58:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 688. [2022-03-15 18:58:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.710334788937409) internal successors, (1862), 687 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1862 transitions. [2022-03-15 18:58:55,291 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1862 transitions. Word has length 30 [2022-03-15 18:58:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:55,291 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1862 transitions. [2022-03-15 18:58:55,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1862 transitions. [2022-03-15 18:58:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:55,292 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:55,292 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:55,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 18:58:55,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:55,509 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash -55696787, now seen corresponding path program 45 times [2022-03-15 18:58:55,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:55,510 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634166326] [2022-03-15 18:58:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:55,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:55,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634166326] [2022-03-15 18:58:55,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634166326] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:55,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016123587] [2022-03-15 18:58:55,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:58:55,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:55,666 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:55,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 18:58:55,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 18:58:55,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:55,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:55,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:58:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:56,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:58:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:57,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016123587] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:58:57,391 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:58:57,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 18:58:57,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556355575] [2022-03-15 18:58:57,391 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:58:57,394 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:58:57,421 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 240 transitions. [2022-03-15 18:58:57,421 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:58:58,898 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [81325#(not (<= (mod ~v_assert~0 256) 0)), 81389#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 81321#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 81388#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 18:58:58,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:58:58,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:58:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:58:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2022-03-15 18:58:58,899 INFO L87 Difference]: Start difference. First operand 688 states and 1862 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:58:59,295 INFO L93 Difference]: Finished difference Result 830 states and 2214 transitions. [2022-03-15 18:58:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:58:59,295 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 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 30 [2022-03-15 18:58:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:58:59,297 INFO L225 Difference]: With dead ends: 830 [2022-03-15 18:58:59,297 INFO L226 Difference]: Without dead ends: 784 [2022-03-15 18:58:59,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 118 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1489, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 18:58:59,310 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 148 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:58:59,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 10 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:58:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-03-15 18:58:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 704. [2022-03-15 18:58:59,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 2.7112375533428166) internal successors, (1906), 703 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1906 transitions. [2022-03-15 18:58:59,321 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1906 transitions. Word has length 30 [2022-03-15 18:58:59,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:58:59,321 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1906 transitions. [2022-03-15 18:58:59,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:58:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1906 transitions. [2022-03-15 18:58:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:58:59,322 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:58:59,322 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:58:59,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-03-15 18:58:59,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:59,529 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:58:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:58:59,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1382126648, now seen corresponding path program 46 times [2022-03-15 18:58:59,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:58:59,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523780885] [2022-03-15 18:58:59,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:58:59,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:58:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:58:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:58:59,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:58:59,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523780885] [2022-03-15 18:58:59,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523780885] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:58:59,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017414315] [2022-03-15 18:58:59,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:58:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:58:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:58:59,648 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:58:59,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 18:58:59,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:58:59,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:58:59,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:58:59,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:00,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:01,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017414315] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:01,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:01,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:01,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776417918] [2022-03-15 18:59:01,502 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:01,504 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:01,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 262 transitions. [2022-03-15 18:59:01,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:03,108 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [83862#(and (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= (+ ~c2~0 1) 0) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 83864#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 83861#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)))), 83793#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 83863#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 83797#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:59:03,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:03,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:03,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:03,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:59:03,109 INFO L87 Difference]: Start difference. First operand 704 states and 1906 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:03,485 INFO L93 Difference]: Finished difference Result 862 states and 2283 transitions. [2022-03-15 18:59:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:59:03,485 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:03,487 INFO L225 Difference]: With dead ends: 862 [2022-03-15 18:59:03,487 INFO L226 Difference]: Without dead ends: 816 [2022-03-15 18:59:03,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 130 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1875, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 18:59:03,487 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 164 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:03,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 5 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-03-15 18:59:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 672. [2022-03-15 18:59:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.709388971684054) internal successors, (1818), 671 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1818 transitions. [2022-03-15 18:59:03,495 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1818 transitions. Word has length 30 [2022-03-15 18:59:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:03,495 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1818 transitions. [2022-03-15 18:59:03,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1818 transitions. [2022-03-15 18:59:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:03,496 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:03,496 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:03,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:03,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-15 18:59:03,711 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1479407728, now seen corresponding path program 47 times [2022-03-15 18:59:03,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:03,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594335755] [2022-03-15 18:59:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:03,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:03,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594335755] [2022-03-15 18:59:03,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594335755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:03,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221947009] [2022-03-15 18:59:03,822 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:59:03,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:03,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:03,823 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:03,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 18:59:03,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 18:59:03,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:03,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:03,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:04,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:05,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221947009] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:05,339 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:05,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:05,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [657603710] [2022-03-15 18:59:05,340 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:05,342 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:05,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 18:59:05,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:07,158 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [86309#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 86310#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 86308#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 86311#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 86242#(not (<= (mod ~v_assert~0 256) 0)), 86307#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 86238#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 86306#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)))] [2022-03-15 18:59:07,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:59:07,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:59:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:59:07,159 INFO L87 Difference]: Start difference. First operand 672 states and 1818 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:07,712 INFO L93 Difference]: Finished difference Result 886 states and 2362 transitions. [2022-03-15 18:59:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:59:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 18:59:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:07,714 INFO L225 Difference]: With dead ends: 886 [2022-03-15 18:59:07,714 INFO L226 Difference]: Without dead ends: 816 [2022-03-15 18:59:07,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 118 SyntacticMatches, 14 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=2316, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 18:59:07,715 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:07,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:59:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-03-15 18:59:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 672. [2022-03-15 18:59:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.709388971684054) internal successors, (1818), 671 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1818 transitions. [2022-03-15 18:59:07,722 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1818 transitions. Word has length 30 [2022-03-15 18:59:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:07,722 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1818 transitions. [2022-03-15 18:59:07,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1818 transitions. [2022-03-15 18:59:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:07,723 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:07,723 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:07,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:07,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-15 18:59:07,940 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 779297872, now seen corresponding path program 48 times [2022-03-15 18:59:07,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:07,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088188913] [2022-03-15 18:59:07,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:08,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:08,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088188913] [2022-03-15 18:59:08,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088188913] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:08,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467371562] [2022-03-15 18:59:08,048 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:59:08,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:08,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:08,050 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:08,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 18:59:08,182 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 18:59:08,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:08,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:08,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:08,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:10,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467371562] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:10,137 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:10,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:59:10,137 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834707964] [2022-03-15 18:59:10,137 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:10,140 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:10,166 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 232 transitions. [2022-03-15 18:59:10,166 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:12,126 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [88784#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 88783#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 88786#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 88782#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 88785#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 88706#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:59:12,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:12,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:12,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:12,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:59:12,133 INFO L87 Difference]: Start difference. First operand 672 states and 1818 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:12,800 INFO L93 Difference]: Finished difference Result 862 states and 2302 transitions. [2022-03-15 18:59:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:59:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:12,802 INFO L225 Difference]: With dead ends: 862 [2022-03-15 18:59:12,802 INFO L226 Difference]: Without dead ends: 816 [2022-03-15 18:59:12,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 100 SyntacticMatches, 26 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=401, Invalid=2049, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 18:59:12,802 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:12,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:59:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-03-15 18:59:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 672. [2022-03-15 18:59:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.709388971684054) internal successors, (1818), 671 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1818 transitions. [2022-03-15 18:59:12,820 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1818 transitions. Word has length 30 [2022-03-15 18:59:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:12,820 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1818 transitions. [2022-03-15 18:59:12,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1818 transitions. [2022-03-15 18:59:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:12,821 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:12,821 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:12,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:13,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-03-15 18:59:13,036 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash -247351891, now seen corresponding path program 49 times [2022-03-15 18:59:13,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:13,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959088337] [2022-03-15 18:59:13,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:13,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:13,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959088337] [2022-03-15 18:59:13,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959088337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:13,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752803139] [2022-03-15 18:59:13,189 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:59:13,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:13,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:13,191 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:13,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 18:59:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:13,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:13,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:13,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:15,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752803139] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:15,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:15,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 18:59:15,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [469862117] [2022-03-15 18:59:15,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:15,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:15,036 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 18:59:15,036 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:18,924 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [91232#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= (+ ~c2~0 1) 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 91230#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1))), 91233#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= (+ ~c2~0 1) 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= (+ ~c2~0 1) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 91167#(not (<= (mod ~v_assert~0 256) 0)), 91163#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 91231#(and (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= (+ ~c2~0 1) 0) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= (+ ~c2~0 1) 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:59:18,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:18,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:59:18,925 INFO L87 Difference]: Start difference. First operand 672 states and 1818 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:19,852 INFO L93 Difference]: Finished difference Result 902 states and 2406 transitions. [2022-03-15 18:59:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:59:19,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:19,855 INFO L225 Difference]: With dead ends: 902 [2022-03-15 18:59:19,855 INFO L226 Difference]: Without dead ends: 832 [2022-03-15 18:59:19,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 43 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=405, Invalid=2145, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 18:59:19,855 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:19,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:59:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-03-15 18:59:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 688. [2022-03-15 18:59:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.710334788937409) internal successors, (1862), 687 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1862 transitions. [2022-03-15 18:59:19,864 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1862 transitions. Word has length 30 [2022-03-15 18:59:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:19,864 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1862 transitions. [2022-03-15 18:59:19,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1862 transitions. [2022-03-15 18:59:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:19,865 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:19,865 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:19,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:20,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-03-15 18:59:20,071 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1902296572, now seen corresponding path program 50 times [2022-03-15 18:59:20,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:20,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885713887] [2022-03-15 18:59:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:20,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:20,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885713887] [2022-03-15 18:59:20,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885713887] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:20,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049069266] [2022-03-15 18:59:20,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:59:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:20,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:20,188 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:20,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 18:59:20,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:59:20,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:20,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:20,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:20,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:21,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049069266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:21,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:21,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:21,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400563867] [2022-03-15 18:59:21,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:21,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:21,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 210 transitions. [2022-03-15 18:59:21,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:23,787 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [93758#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 93760#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0))), 93761#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 93681#(not (<= (mod ~v_assert~0 256) 0)), 93759#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 93757#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:59:23,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:23,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:23,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:23,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:59:23,788 INFO L87 Difference]: Start difference. First operand 688 states and 1862 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:24,427 INFO L93 Difference]: Finished difference Result 934 states and 2500 transitions. [2022-03-15 18:59:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 18:59:24,427 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:24,433 INFO L225 Difference]: With dead ends: 934 [2022-03-15 18:59:24,433 INFO L226 Difference]: Without dead ends: 888 [2022-03-15 18:59:24,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 108 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=479, Invalid=2383, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 18:59:24,434 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:24,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:59:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-03-15 18:59:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 688. [2022-03-15 18:59:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.710334788937409) internal successors, (1862), 687 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1862 transitions. [2022-03-15 18:59:24,442 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1862 transitions. Word has length 30 [2022-03-15 18:59:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:24,442 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1862 transitions. [2022-03-15 18:59:24,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1862 transitions. [2022-03-15 18:59:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:24,443 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:24,443 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:24,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-03-15 18:59:24,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-15 18:59:24,657 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1858072304, now seen corresponding path program 51 times [2022-03-15 18:59:24,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:24,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652271293] [2022-03-15 18:59:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:24,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:24,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652271293] [2022-03-15 18:59:24,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652271293] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:24,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236271115] [2022-03-15 18:59:24,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:59:24,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:24,801 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:24,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 18:59:24,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 18:59:24,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:24,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:24,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:25,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:26,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236271115] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:26,636 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:26,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:59:26,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [185551136] [2022-03-15 18:59:26,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:26,643 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:26,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 210 transitions. [2022-03-15 18:59:26,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:27,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [96241#(not (<= (mod ~v_assert~0 256) 0)), 96318#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 96316#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 96317#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)))] [2022-03-15 18:59:27,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:59:27,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:59:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2022-03-15 18:59:27,723 INFO L87 Difference]: Start difference. First operand 688 states and 1862 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:28,079 INFO L93 Difference]: Finished difference Result 934 states and 2500 transitions. [2022-03-15 18:59:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:59:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 18:59:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:28,081 INFO L225 Difference]: With dead ends: 934 [2022-03-15 18:59:28,081 INFO L226 Difference]: Without dead ends: 888 [2022-03-15 18:59:28,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:59:28,082 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 164 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:28,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 7 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-03-15 18:59:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 720. [2022-03-15 18:59:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.7121001390820583) internal successors, (1950), 719 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1950 transitions. [2022-03-15 18:59:28,090 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1950 transitions. Word has length 30 [2022-03-15 18:59:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:28,090 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1950 transitions. [2022-03-15 18:59:28,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:28,090 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1950 transitions. [2022-03-15 18:59:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:28,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:28,091 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:28,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-03-15 18:59:28,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 18:59:28,308 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1110465131, now seen corresponding path program 52 times [2022-03-15 18:59:28,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:28,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472206209] [2022-03-15 18:59:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:28,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:28,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472206209] [2022-03-15 18:59:28,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472206209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:28,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659957909] [2022-03-15 18:59:28,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:59:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:28,420 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:28,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 18:59:28,505 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:59:28,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:28,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:28,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:28,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:29,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659957909] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:29,976 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:29,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:29,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074932528] [2022-03-15 18:59:29,976 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:29,979 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:30,007 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 18:59:30,008 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:31,794 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [98866#(not (<= (mod ~v_assert~0 256) 0)), 98930#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 98933#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 98931#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 98934#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0))), 98862#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 98932#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 98935#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:59:31,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 18:59:31,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:31,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 18:59:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 18:59:31,795 INFO L87 Difference]: Start difference. First operand 720 states and 1950 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:32,240 INFO L93 Difference]: Finished difference Result 894 states and 2371 transitions. [2022-03-15 18:59:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 18:59:32,241 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 18:59:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:32,246 INFO L225 Difference]: With dead ends: 894 [2022-03-15 18:59:32,246 INFO L226 Difference]: Without dead ends: 848 [2022-03-15 18:59:32,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 118 SyntacticMatches, 14 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=2116, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 18:59:32,247 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 173 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:32,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 9 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-03-15 18:59:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 704. [2022-03-15 18:59:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 2.7112375533428166) internal successors, (1906), 703 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1906 transitions. [2022-03-15 18:59:32,260 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1906 transitions. Word has length 30 [2022-03-15 18:59:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:32,260 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1906 transitions. [2022-03-15 18:59:32,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1906 transitions. [2022-03-15 18:59:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:32,261 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:32,261 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:32,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:32,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:32,478 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2016655622, now seen corresponding path program 53 times [2022-03-15 18:59:32,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:32,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756959685] [2022-03-15 18:59:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:32,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:32,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:32,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756959685] [2022-03-15 18:59:32,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756959685] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:32,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202551407] [2022-03-15 18:59:32,593 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 18:59:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:32,594 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:32,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 18:59:32,741 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 18:59:32,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:32,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:32,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:33,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:34,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202551407] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:34,082 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:34,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 18:59:34,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [649570312] [2022-03-15 18:59:34,082 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:34,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:34,110 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 232 transitions. [2022-03-15 18:59:34,110 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:35,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [101474#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 101476#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 101475#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 101406#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 101477#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 101410#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 18:59:35,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:35,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:59:35,775 INFO L87 Difference]: Start difference. First operand 704 states and 1906 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:36,381 INFO L93 Difference]: Finished difference Result 926 states and 2459 transitions. [2022-03-15 18:59:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 18:59:36,381 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:36,382 INFO L225 Difference]: With dead ends: 926 [2022-03-15 18:59:36,382 INFO L226 Difference]: Without dead ends: 880 [2022-03-15 18:59:36,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 101 SyntacticMatches, 26 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 18:59:36,383 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 171 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:36,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 12 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:59:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-03-15 18:59:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 720. [2022-03-15 18:59:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.7121001390820583) internal successors, (1950), 719 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1950 transitions. [2022-03-15 18:59:36,390 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1950 transitions. Word has length 30 [2022-03-15 18:59:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:36,391 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1950 transitions. [2022-03-15 18:59:36,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:36,391 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1950 transitions. [2022-03-15 18:59:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:36,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:36,392 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:36,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-03-15 18:59:36,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:36,608 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -626016467, now seen corresponding path program 54 times [2022-03-15 18:59:36,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:36,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591439864] [2022-03-15 18:59:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:36,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:36,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591439864] [2022-03-15 18:59:36,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591439864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:36,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854349037] [2022-03-15 18:59:36,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 18:59:36,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:36,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:36,775 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:36,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 18:59:36,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 18:59:36,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:36,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:36,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:37,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:37,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:38,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854349037] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:38,466 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:38,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 18:59:38,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644600886] [2022-03-15 18:59:38,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:38,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:38,495 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 232 transitions. [2022-03-15 18:59:38,495 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:40,155 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [104083#(and (or (<= 1 ~pos~0) (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 104006#(not (<= (mod ~v_assert~0 256) 0)), 104081#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 104082#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c2~0 1) 0)))] [2022-03-15 18:59:40,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 18:59:40,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:40,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 18:59:40,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:59:40,156 INFO L87 Difference]: Start difference. First operand 720 states and 1950 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:40,625 INFO L93 Difference]: Finished difference Result 846 states and 2258 transitions. [2022-03-15 18:59:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 18:59:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:40,627 INFO L225 Difference]: With dead ends: 846 [2022-03-15 18:59:40,627 INFO L226 Difference]: Without dead ends: 800 [2022-03-15 18:59:40,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 110 SyntacticMatches, 19 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=310, Invalid=1496, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 18:59:40,628 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 158 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:40,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 8 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-03-15 18:59:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 720. [2022-03-15 18:59:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.7121001390820583) internal successors, (1950), 719 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1950 transitions. [2022-03-15 18:59:40,635 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1950 transitions. Word has length 30 [2022-03-15 18:59:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:40,635 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1950 transitions. [2022-03-15 18:59:40,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1950 transitions. [2022-03-15 18:59:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:40,636 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:40,636 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:40,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:40,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:40,854 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1952446328, now seen corresponding path program 55 times [2022-03-15 18:59:40,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:40,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880094856] [2022-03-15 18:59:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:41,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:41,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880094856] [2022-03-15 18:59:41,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880094856] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:41,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957163110] [2022-03-15 18:59:41,018 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 18:59:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:41,019 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:41,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 18:59:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:41,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:41,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:41,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:43,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957163110] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:43,013 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:43,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:43,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2118502989] [2022-03-15 18:59:43,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:43,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:43,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 18:59:43,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:44,893 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [106602#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 106603#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 106533#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 106537#(not (<= (mod ~v_assert~0 256) 0)), 106601#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 106604#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 18:59:44,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:44,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:44,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:44,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:59:44,894 INFO L87 Difference]: Start difference. First operand 720 states and 1950 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:45,257 INFO L93 Difference]: Finished difference Result 910 states and 2415 transitions. [2022-03-15 18:59:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 18:59:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:45,259 INFO L225 Difference]: With dead ends: 910 [2022-03-15 18:59:45,259 INFO L226 Difference]: Without dead ends: 864 [2022-03-15 18:59:45,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=370, Invalid=1792, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 18:59:45,259 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 144 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:45,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 6 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-03-15 18:59:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 688. [2022-03-15 18:59:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 2.710334788937409) internal successors, (1862), 687 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1862 transitions. [2022-03-15 18:59:45,267 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1862 transitions. Word has length 30 [2022-03-15 18:59:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:45,267 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 1862 transitions. [2022-03-15 18:59:45,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1862 transitions. [2022-03-15 18:59:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:45,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:45,268 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:45,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:45,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-03-15 18:59:45,483 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1954860496, now seen corresponding path program 56 times [2022-03-15 18:59:45,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:45,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829436417] [2022-03-15 18:59:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:45,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:45,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829436417] [2022-03-15 18:59:45,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829436417] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:45,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537897192] [2022-03-15 18:59:45,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 18:59:45,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:45,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:45,597 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:45,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 18:59:45,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 18:59:45,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:45,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:45,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:46,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:47,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537897192] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:47,367 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:47,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:47,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076836276] [2022-03-15 18:59:47,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:47,370 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:47,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 188 transitions. [2022-03-15 18:59:47,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:48,388 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [109048#(not (<= (mod ~v_assert~0 256) 0)), 109124#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 18:59:48,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 18:59:48,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 18:59:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-03-15 18:59:48,392 INFO L87 Difference]: Start difference. First operand 688 states and 1862 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:48,748 INFO L93 Difference]: Finished difference Result 830 states and 2233 transitions. [2022-03-15 18:59:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 18:59:48,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:48,749 INFO L225 Difference]: With dead ends: 830 [2022-03-15 18:59:48,749 INFO L226 Difference]: Without dead ends: 784 [2022-03-15 18:59:48,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 102 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1616, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 18:59:48,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:48,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-03-15 18:59:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 632. [2022-03-15 18:59:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 2.7068145800316956) internal successors, (1708), 631 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1708 transitions. [2022-03-15 18:59:48,760 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1708 transitions. Word has length 30 [2022-03-15 18:59:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:48,760 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 1708 transitions. [2022-03-15 18:59:48,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1708 transitions. [2022-03-15 18:59:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:48,761 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:48,761 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:48,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 18:59:48,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-03-15 18:59:48,975 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash 928210733, now seen corresponding path program 57 times [2022-03-15 18:59:48,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:48,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259787997] [2022-03-15 18:59:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:49,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:49,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259787997] [2022-03-15 18:59:49,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259787997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:49,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522334471] [2022-03-15 18:59:49,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 18:59:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:49,090 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:49,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 18:59:49,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 18:59:49,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:49,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:49,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:49,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:51,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522334471] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:51,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:51,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-15 18:59:51,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075861204] [2022-03-15 18:59:51,161 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:51,164 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:51,193 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 18:59:51,193 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:53,514 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [111454#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 111453#(and (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 111452#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (<= 3 ~pos~0))), 111377#(not (<= (mod ~v_assert~0 256) 0)), 111455#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 111456#(and (or (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 18:59:53,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:53,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:53,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:53,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2022-03-15 18:59:53,515 INFO L87 Difference]: Start difference. First operand 632 states and 1708 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:54,903 INFO L93 Difference]: Finished difference Result 1136 states and 2991 transitions. [2022-03-15 18:59:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 18:59:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:54,905 INFO L225 Difference]: With dead ends: 1136 [2022-03-15 18:59:54,905 INFO L226 Difference]: Without dead ends: 1048 [2022-03-15 18:59:54,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=613, Invalid=2809, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 18:59:54,906 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 289 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:54,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 0 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 18:59:54,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-03-15 18:59:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 744. [2022-03-15 18:59:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.7133243606998656) internal successors, (2016), 743 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2016 transitions. [2022-03-15 18:59:54,915 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2016 transitions. Word has length 30 [2022-03-15 18:59:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:54,915 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2016 transitions. [2022-03-15 18:59:54,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2016 transitions. [2022-03-15 18:59:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:54,916 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:54,916 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:59:54,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-15 18:59:55,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:55,137 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 18:59:55,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:59:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1534621126, now seen corresponding path program 58 times [2022-03-15 18:59:55,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:59:55,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984204240] [2022-03-15 18:59:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:59:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:59:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:59:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:55,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:59:55,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984204240] [2022-03-15 18:59:55,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984204240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:59:55,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85701549] [2022-03-15 18:59:55,254 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 18:59:55,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:59:55,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:59:55,272 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:59:55,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 18:59:55,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 18:59:55,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 18:59:55,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 18:59:55,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:59:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:55,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:59:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:59:57,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85701549] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:59:57,136 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:59:57,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 18:59:57,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119627345] [2022-03-15 18:59:57,136 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:59:57,139 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:59:57,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 232 transitions. [2022-03-15 18:59:57,165 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:59:59,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [114272#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 114340#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 114276#(not (<= (mod ~v_assert~0 256) 0)), 114343#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 114341#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 114342#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 18:59:59,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 18:59:59,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:59:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 18:59:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-03-15 18:59:59,350 INFO L87 Difference]: Start difference. First operand 744 states and 2016 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:59:59,976 INFO L93 Difference]: Finished difference Result 950 states and 2544 transitions. [2022-03-15 18:59:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 18:59:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 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 30 [2022-03-15 18:59:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:59:59,977 INFO L225 Difference]: With dead ends: 950 [2022-03-15 18:59:59,977 INFO L226 Difference]: Without dead ends: 904 [2022-03-15 18:59:59,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=499, Invalid=2363, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 18:59:59,980 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 208 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:59:59,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 0 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:59:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2022-03-15 18:59:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 744. [2022-03-15 18:59:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.7133243606998656) internal successors, (2016), 743 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2016 transitions. [2022-03-15 18:59:59,987 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2016 transitions. Word has length 30 [2022-03-15 18:59:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:59:59,988 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2016 transitions. [2022-03-15 18:59:59,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:59:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2016 transitions. [2022-03-15 18:59:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 18:59:59,989 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:59:59,989 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:00,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:00,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:00,205 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1108050963, now seen corresponding path program 59 times [2022-03-15 19:00:00,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:00,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019700846] [2022-03-15 19:00:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:00,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:00,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019700846] [2022-03-15 19:00:00,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019700846] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:00,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128967069] [2022-03-15 19:00:00,334 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:00:00,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:00,335 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:00,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 19:00:00,508 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:00:00,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:00,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:00:00,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:00,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:02,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128967069] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:02,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:02,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 19:00:02,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353250841] [2022-03-15 19:00:02,242 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:02,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:02,288 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 232 transitions. [2022-03-15 19:00:02,288 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:04,149 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [117030#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 116961#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 117029#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 116965#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:00:04,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:00:04,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:00:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:00:04,149 INFO L87 Difference]: Start difference. First operand 744 states and 2016 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:04,620 INFO L93 Difference]: Finished difference Result 926 states and 2478 transitions. [2022-03-15 19:00:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:00:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 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 30 [2022-03-15 19:00:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:04,622 INFO L225 Difference]: With dead ends: 926 [2022-03-15 19:00:04,622 INFO L226 Difference]: Without dead ends: 880 [2022-03-15 19:00:04,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 120 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:00:04,623 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:04,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 3 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-03-15 19:00:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 744. [2022-03-15 19:00:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.7133243606998656) internal successors, (2016), 743 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2016 transitions. [2022-03-15 19:00:04,630 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2016 transitions. Word has length 30 [2022-03-15 19:00:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:04,630 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2016 transitions. [2022-03-15 19:00:04,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2016 transitions. [2022-03-15 19:00:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:00:04,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:04,631 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:04,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-03-15 19:00:04,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 19:00:04,847 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -776883704, now seen corresponding path program 60 times [2022-03-15 19:00:04,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:04,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743435527] [2022-03-15 19:00:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:04,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:04,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743435527] [2022-03-15 19:00:04,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743435527] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:04,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764368232] [2022-03-15 19:00:04,986 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:00:04,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:04,987 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:04,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 19:00:05,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:00:05,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:05,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:00:05,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:05,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:06,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764368232] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:06,615 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:06,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 19:00:06,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57520023] [2022-03-15 19:00:06,615 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:06,617 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:06,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 19:00:06,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:08,451 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [119681#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 119683#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 119682#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 119684#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 119680#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 119604#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:00:08,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:00:08,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:00:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:00:08,452 INFO L87 Difference]: Start difference. First operand 744 states and 2016 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:08,966 INFO L93 Difference]: Finished difference Result 974 states and 2618 transitions. [2022-03-15 19:00:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:00:08,966 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 30 [2022-03-15 19:00:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:08,967 INFO L225 Difference]: With dead ends: 974 [2022-03-15 19:00:08,967 INFO L226 Difference]: Without dead ends: 928 [2022-03-15 19:00:08,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 114 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=462, Invalid=2294, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:00:08,968 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:08,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:00:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-03-15 19:00:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 760. [2022-03-15 19:00:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 2.7140974967061924) internal successors, (2060), 759 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 2060 transitions. [2022-03-15 19:00:08,976 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 2060 transitions. Word has length 30 [2022-03-15 19:00:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:08,976 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 2060 transitions. [2022-03-15 19:00:08,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 2060 transitions. [2022-03-15 19:00:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:00:08,977 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:08,977 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:08,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:09,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 19:00:09,196 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash 754952231, now seen corresponding path program 61 times [2022-03-15 19:00:09,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:09,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083011015] [2022-03-15 19:00:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:09,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:09,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083011015] [2022-03-15 19:00:09,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083011015] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:09,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70786897] [2022-03-15 19:00:09,294 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:00:09,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:09,296 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:09,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 19:00:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:09,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:00:09,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:09,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:10,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70786897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:10,844 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:10,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 19:00:10,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101933034] [2022-03-15 19:00:10,844 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:10,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:10,881 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 254 transitions. [2022-03-15 19:00:10,882 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:13,039 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [122358#(not (<= (mod ~v_assert~0 256) 0)), 122354#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:00:13,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:00:13,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:00:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:00:13,040 INFO L87 Difference]: Start difference. First operand 760 states and 2060 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:13,566 INFO L93 Difference]: Finished difference Result 854 states and 2299 transitions. [2022-03-15 19:00:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:00:13,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 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 30 [2022-03-15 19:00:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:13,568 INFO L225 Difference]: With dead ends: 854 [2022-03-15 19:00:13,568 INFO L226 Difference]: Without dead ends: 808 [2022-03-15 19:00:13,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 102 SyntacticMatches, 36 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=392, Invalid=1588, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:00:13,568 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:13,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:00:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-03-15 19:00:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 760. [2022-03-15 19:00:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 2.7140974967061924) internal successors, (2060), 759 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 2060 transitions. [2022-03-15 19:00:13,576 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 2060 transitions. Word has length 30 [2022-03-15 19:00:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:13,577 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 2060 transitions. [2022-03-15 19:00:13,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 2060 transitions. [2022-03-15 19:00:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:00:13,578 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:13,578 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:13,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:13,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:13,778 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1345378028, now seen corresponding path program 5 times [2022-03-15 19:00:13,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:13,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726757074] [2022-03-15 19:00:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:13,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:13,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726757074] [2022-03-15 19:00:13,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726757074] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:13,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774016576] [2022-03-15 19:00:13,907 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:00:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:13,908 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:13,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 19:00:14,057 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:00:14,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:14,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:00:14,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:14,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:15,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774016576] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:15,447 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:15,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 19:00:15,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529499955] [2022-03-15 19:00:15,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:15,449 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:15,469 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 140 transitions. [2022-03-15 19:00:15,470 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:16,463 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [124964#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 124968#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:00:16,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:00:16,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:00:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:00:16,464 INFO L87 Difference]: Start difference. First operand 760 states and 2060 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:16,885 INFO L93 Difference]: Finished difference Result 860 states and 2314 transitions. [2022-03-15 19:00:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:00:16,885 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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 30 [2022-03-15 19:00:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:16,886 INFO L225 Difference]: With dead ends: 860 [2022-03-15 19:00:16,886 INFO L226 Difference]: Without dead ends: 808 [2022-03-15 19:00:16,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 27 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:00:16,887 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:16,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:00:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-03-15 19:00:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 768. [2022-03-15 19:00:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 2.714471968709257) internal successors, (2082), 767 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 2082 transitions. [2022-03-15 19:00:16,895 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 2082 transitions. Word has length 30 [2022-03-15 19:00:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:16,895 INFO L470 AbstractCegarLoop]: Abstraction has 768 states and 2082 transitions. [2022-03-15 19:00:16,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 2082 transitions. [2022-03-15 19:00:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:16,896 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:16,896 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:16,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:17,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-03-15 19:00:17,099 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689851, now seen corresponding path program 62 times [2022-03-15 19:00:17,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:17,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687397378] [2022-03-15 19:00:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:17,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:17,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:17,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687397378] [2022-03-15 19:00:17,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687397378] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:17,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389451099] [2022-03-15 19:00:17,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:00:17,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:17,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:17,220 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:17,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 19:00:17,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:00:17,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:17,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:17,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:17,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:19,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389451099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:19,371 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:19,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:00:19,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [396357664] [2022-03-15 19:00:19,371 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:19,375 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:19,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 140 states and 274 transitions. [2022-03-15 19:00:19,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:22,004 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [127690#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 127684#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0))), 127686#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 127689#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 127608#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 127687#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 127688#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 127612#(not (<= (mod ~v_assert~0 256) 0)), 127685#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 127691#(and (or (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)))] [2022-03-15 19:00:22,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:00:22,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:00:22,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1156, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:00:22,005 INFO L87 Difference]: Start difference. First operand 768 states and 2082 transitions. Second operand has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:22,779 INFO L93 Difference]: Finished difference Result 1062 states and 2854 transitions. [2022-03-15 19:00:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:00:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:00:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:22,780 INFO L225 Difference]: With dead ends: 1062 [2022-03-15 19:00:22,780 INFO L226 Difference]: Without dead ends: 992 [2022-03-15 19:00:22,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 123 SyntacticMatches, 21 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=643, Invalid=3139, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:00:22,781 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:22,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-03-15 19:00:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 768. [2022-03-15 19:00:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 2.714471968709257) internal successors, (2082), 767 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 2082 transitions. [2022-03-15 19:00:22,789 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 2082 transitions. Word has length 32 [2022-03-15 19:00:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:22,789 INFO L470 AbstractCegarLoop]: Abstraction has 768 states and 2082 transitions. [2022-03-15 19:00:22,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 2082 transitions. [2022-03-15 19:00:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:22,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:22,790 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:22,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-03-15 19:00:23,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:23,001 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash -42331484, now seen corresponding path program 63 times [2022-03-15 19:00:23,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:23,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072162191] [2022-03-15 19:00:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:23,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:23,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072162191] [2022-03-15 19:00:23,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072162191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:23,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620952590] [2022-03-15 19:00:23,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:00:23,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:23,166 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:23,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 19:00:23,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:00:23,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:23,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:23,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:23,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:25,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620952590] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:25,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:25,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:00:25,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748975440] [2022-03-15 19:00:25,823 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:25,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:25,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 314 transitions. [2022-03-15 19:00:25,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:29,167 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [130559#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 130483#(not (<= (mod ~v_assert~0 256) 0)), 130560#(and (or (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 130556#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 130562#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0))), 130479#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 130557#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 130555#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 130561#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 130558#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:00:29,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:00:29,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:29,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:00:29,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:00:29,168 INFO L87 Difference]: Start difference. First operand 768 states and 2082 transitions. Second operand has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:29,846 INFO L93 Difference]: Finished difference Result 1112 states and 2964 transitions. [2022-03-15 19:00:29,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:00:29,847 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 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 32 [2022-03-15 19:00:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:29,848 INFO L225 Difference]: With dead ends: 1112 [2022-03-15 19:00:29,848 INFO L226 Difference]: Without dead ends: 1056 [2022-03-15 19:00:29,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 98 SyntacticMatches, 59 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=506, Invalid=2916, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:00:29,865 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:29,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 0 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-15 19:00:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 800. [2022-03-15 19:00:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.7058823529411766) internal successors, (2162), 799 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2162 transitions. [2022-03-15 19:00:29,874 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2162 transitions. Word has length 32 [2022-03-15 19:00:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:29,874 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2162 transitions. [2022-03-15 19:00:29,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2162 transitions. [2022-03-15 19:00:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:29,875 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:29,876 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:29,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:30,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:30,078 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash 564078909, now seen corresponding path program 64 times [2022-03-15 19:00:30,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:30,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507017557] [2022-03-15 19:00:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:30,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:30,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507017557] [2022-03-15 19:00:30,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507017557] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:30,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108699012] [2022-03-15 19:00:30,227 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:00:30,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:30,228 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:30,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 19:00:30,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:00:30,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:30,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:30,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:30,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:32,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108699012] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:32,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:32,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:00:32,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1929710999] [2022-03-15 19:00:32,473 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:32,476 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:32,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 292 transitions. [2022-03-15 19:00:32,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:35,002 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [133455#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 133536#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 133459#(not (<= (mod ~v_assert~0 256) 0)), 133535#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 133534#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 133533#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 133537#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 133531#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 133538#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 133532#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:00:35,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:00:35,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:35,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:00:35,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:00:35,003 INFO L87 Difference]: Start difference. First operand 800 states and 2162 transitions. Second operand has 22 states, 22 states have (on average 4.5) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:35,982 INFO L93 Difference]: Finished difference Result 1134 states and 3023 transitions. [2022-03-15 19:00:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:00:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 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 32 [2022-03-15 19:00:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:35,984 INFO L225 Difference]: With dead ends: 1134 [2022-03-15 19:00:35,984 INFO L226 Difference]: Without dead ends: 1088 [2022-03-15 19:00:35,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=560, Invalid=2980, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:00:35,985 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:35,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:00:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2022-03-15 19:00:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 800. [2022-03-15 19:00:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.7058823529411766) internal successors, (2162), 799 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2162 transitions. [2022-03-15 19:00:35,994 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2162 transitions. Word has length 32 [2022-03-15 19:00:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:35,994 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2162 transitions. [2022-03-15 19:00:35,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 21 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2162 transitions. [2022-03-15 19:00:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:35,996 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:35,996 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:36,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:36,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-03-15 19:00:36,197 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2078593180, now seen corresponding path program 65 times [2022-03-15 19:00:36,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:36,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064313329] [2022-03-15 19:00:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:36,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:36,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064313329] [2022-03-15 19:00:36,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064313329] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:36,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767858524] [2022-03-15 19:00:36,400 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:00:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:36,401 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:36,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 19:00:36,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:00:36,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:36,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:36,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:37,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:38,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767858524] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:38,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:38,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:00:38,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728253346] [2022-03-15 19:00:38,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:38,607 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:38,643 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 292 transitions. [2022-03-15 19:00:38,643 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:41,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [136458#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 136535#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 136538#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 136539#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0))), 136462#(not (<= (mod ~v_assert~0 256) 0)), 136534#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 136536#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 136537#(and (or (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:00:41,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:00:41,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:41,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:00:41,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:00:41,440 INFO L87 Difference]: Start difference. First operand 800 states and 2162 transitions. Second operand has 20 states, 20 states have (on average 4.5) internal successors, (90), 19 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:42,030 INFO L93 Difference]: Finished difference Result 1086 states and 2910 transitions. [2022-03-15 19:00:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:00:42,030 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.5) internal successors, (90), 19 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:00:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:42,032 INFO L225 Difference]: With dead ends: 1086 [2022-03-15 19:00:42,032 INFO L226 Difference]: Without dead ends: 1040 [2022-03-15 19:00:42,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 85 SyntacticMatches, 66 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2496 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=503, Invalid=2689, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:00:42,032 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:42,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2022-03-15 19:00:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 816. [2022-03-15 19:00:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 2.7067484662576686) internal successors, (2206), 815 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2206 transitions. [2022-03-15 19:00:42,041 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 2206 transitions. Word has length 32 [2022-03-15 19:00:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:42,041 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 2206 transitions. [2022-03-15 19:00:42,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.5) internal successors, (90), 19 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 2206 transitions. [2022-03-15 19:00:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:42,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:42,042 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:42,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:42,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:42,247 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 889944255, now seen corresponding path program 66 times [2022-03-15 19:00:42,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:42,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846129995] [2022-03-15 19:00:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:42,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:42,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:42,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846129995] [2022-03-15 19:00:42,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846129995] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:42,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206036982] [2022-03-15 19:00:42,383 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:00:42,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:42,400 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:42,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 19:00:42,536 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:00:42,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:42,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:42,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:43,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:45,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206036982] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:45,266 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:45,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:00:45,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417213159] [2022-03-15 19:00:45,266 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:45,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:45,309 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 314 transitions. [2022-03-15 19:00:45,309 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:47,759 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [139517#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 139518#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 139442#(not (<= (mod ~v_assert~0 256) 0)), 139519#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 139520#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 139514#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 139521#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 139438#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 139516#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 139515#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:00:47,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:00:47,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:00:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:00:47,760 INFO L87 Difference]: Start difference. First operand 816 states and 2206 transitions. Second operand has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:48,352 INFO L93 Difference]: Finished difference Result 1102 states and 2935 transitions. [2022-03-15 19:00:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:00:48,352 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 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 32 [2022-03-15 19:00:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:48,353 INFO L225 Difference]: With dead ends: 1102 [2022-03-15 19:00:48,354 INFO L226 Difference]: Without dead ends: 1056 [2022-03-15 19:00:48,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 131 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=547, Invalid=2759, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:00:48,354 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:48,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-15 19:00:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 800. [2022-03-15 19:00:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.7058823529411766) internal successors, (2162), 799 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2162 transitions. [2022-03-15 19:00:48,363 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2162 transitions. Word has length 32 [2022-03-15 19:00:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:48,363 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2162 transitions. [2022-03-15 19:00:48,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2162 transitions. [2022-03-15 19:00:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:48,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:48,364 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:48,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:48,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:48,578 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash -504541689, now seen corresponding path program 67 times [2022-03-15 19:00:48,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:48,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193854669] [2022-03-15 19:00:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:48,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:48,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193854669] [2022-03-15 19:00:48,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193854669] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:48,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580556297] [2022-03-15 19:00:48,719 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:00:48,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:48,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:48,720 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:48,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 19:00:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:48,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:48,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:49,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:51,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580556297] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:51,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:51,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:00:51,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561628984] [2022-03-15 19:00:51,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:51,089 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:51,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 240 transitions. [2022-03-15 19:00:51,123 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:53,574 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [142482#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 142409#(not (<= (mod ~v_assert~0 256) 0)), 142405#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 142481#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 142483#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 142484#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:00:53,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:00:53,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:53,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:00:53,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=978, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:00:53,575 INFO L87 Difference]: Start difference. First operand 800 states and 2162 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:00:54,208 INFO L93 Difference]: Finished difference Result 990 states and 2646 transitions. [2022-03-15 19:00:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:00:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 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 32 [2022-03-15 19:00:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:00:54,209 INFO L225 Difference]: With dead ends: 990 [2022-03-15 19:00:54,209 INFO L226 Difference]: Without dead ends: 944 [2022-03-15 19:00:54,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 101 SyntacticMatches, 32 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=404, Invalid=2146, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:00:54,210 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:00:54,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:00:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-03-15 19:00:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 800. [2022-03-15 19:00:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.7058823529411766) internal successors, (2162), 799 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2162 transitions. [2022-03-15 19:00:54,219 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2162 transitions. Word has length 32 [2022-03-15 19:00:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:00:54,220 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 2162 transitions. [2022-03-15 19:00:54,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:00:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2162 transitions. [2022-03-15 19:00:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:00:54,221 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:00:54,221 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:00:54,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-03-15 19:00:54,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:54,426 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:00:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:00:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1531191452, now seen corresponding path program 68 times [2022-03-15 19:00:54,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:00:54,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919924420] [2022-03-15 19:00:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:00:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:00:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:00:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:54,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:00:54,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919924420] [2022-03-15 19:00:54,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919924420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:00:54,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597321358] [2022-03-15 19:00:54,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:00:54,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:00:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:00:54,611 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:00:54,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 19:00:54,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:00:54,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:00:54,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:00:54,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:00:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:55,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:00:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:00:56,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597321358] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:00:56,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:00:56,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:00:56,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795462088] [2022-03-15 19:00:56,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:00:56,987 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:00:57,024 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 306 transitions. [2022-03-15 19:00:57,024 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:00:59,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [145325#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 145329#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 145328#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 145330#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 145331#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 145248#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 145324#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 145252#(not (<= (mod ~v_assert~0 256) 0)), 145327#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 145326#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:00:59,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:00:59,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:00:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:00:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:00:59,842 INFO L87 Difference]: Start difference. First operand 800 states and 2162 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:00,480 INFO L93 Difference]: Finished difference Result 1054 states and 2803 transitions. [2022-03-15 19:01:00,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:01:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:00,481 INFO L225 Difference]: With dead ends: 1054 [2022-03-15 19:01:00,481 INFO L226 Difference]: Without dead ends: 1008 [2022-03-15 19:01:00,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 95 SyntacticMatches, 58 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=473, Invalid=2833, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:01:00,482 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:00,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-03-15 19:01:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 832. [2022-03-15 19:01:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 2.707581227436823) internal successors, (2250), 831 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 2250 transitions. [2022-03-15 19:01:00,490 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 2250 transitions. Word has length 32 [2022-03-15 19:01:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:00,490 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 2250 transitions. [2022-03-15 19:01:00,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 2250 transitions. [2022-03-15 19:01:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:00,492 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:00,492 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:00,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:00,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-15 19:01:00,707 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -924781059, now seen corresponding path program 69 times [2022-03-15 19:01:00,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:00,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122146167] [2022-03-15 19:01:00,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:00,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:00,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122146167] [2022-03-15 19:01:00,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122146167] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:00,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69008503] [2022-03-15 19:01:00,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:01:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:00,831 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 19:01:00,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:01:00,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:00,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:00,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:01,395 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:01,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:02,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69008503] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:02,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:02,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:01:02,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689639333] [2022-03-15 19:01:02,787 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:02,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:02,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 284 transitions. [2022-03-15 19:01:02,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:05,571 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [148310#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 148232#(not (<= (mod ~v_assert~0 256) 0)), 148306#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0))), 148307#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 148308#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 148309#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 148304#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 148228#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 148311#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 148305#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:01:05,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:01:05,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:01:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:01:05,572 INFO L87 Difference]: Start difference. First operand 832 states and 2250 transitions. Second operand has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:06,272 INFO L93 Difference]: Finished difference Result 1198 states and 3199 transitions. [2022-03-15 19:01:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:01:06,272 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:06,274 INFO L225 Difference]: With dead ends: 1198 [2022-03-15 19:01:06,274 INFO L226 Difference]: Without dead ends: 1152 [2022-03-15 19:01:06,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 113 SyntacticMatches, 33 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=619, Invalid=3287, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:01:06,275 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:06,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-03-15 19:01:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 896. [2022-03-15 19:01:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 2.7106145251396647) internal successors, (2426), 895 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2426 transitions. [2022-03-15 19:01:06,284 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2426 transitions. Word has length 32 [2022-03-15 19:01:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:06,284 INFO L470 AbstractCegarLoop]: Abstraction has 896 states and 2426 transitions. [2022-03-15 19:01:06,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2426 transitions. [2022-03-15 19:01:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:06,286 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:06,286 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:06,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:06,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:06,503 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:06,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:06,503 INFO L85 PathProgramCache]: Analyzing trace with hash 727514148, now seen corresponding path program 70 times [2022-03-15 19:01:06,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:06,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887999562] [2022-03-15 19:01:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:06,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:06,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887999562] [2022-03-15 19:01:06,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887999562] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:06,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425258087] [2022-03-15 19:01:06,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:01:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:06,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:06,700 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:06,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 19:01:06,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:01:06,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:06,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:06,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:07,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:09,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425258087] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:09,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:09,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:01:09,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344175616] [2022-03-15 19:01:09,409 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:09,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:09,447 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 284 transitions. [2022-03-15 19:01:09,447 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:12,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [151573#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 151572#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 151568#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c1~0 1) ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2))), 151493#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 151571#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 151570#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 151497#(not (<= (mod ~v_assert~0 256) 0)), 151569#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= (+ ~c1~0 1) ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:01:12,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:01:12,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:01:12,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:01:12,734 INFO L87 Difference]: Start difference. First operand 896 states and 2426 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:13,320 INFO L93 Difference]: Finished difference Result 1102 states and 2935 transitions. [2022-03-15 19:01:13,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:01:13,320 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:01:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:13,321 INFO L225 Difference]: With dead ends: 1102 [2022-03-15 19:01:13,321 INFO L226 Difference]: Without dead ends: 1056 [2022-03-15 19:01:13,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 90 SyntacticMatches, 58 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2027 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=434, Invalid=2428, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:01:13,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:13,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-15 19:01:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 912. [2022-03-15 19:01:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 2.711306256860593) internal successors, (2470), 911 states have internal predecessors, (2470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 2470 transitions. [2022-03-15 19:01:13,331 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 2470 transitions. Word has length 32 [2022-03-15 19:01:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:13,331 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 2470 transitions. [2022-03-15 19:01:13,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 2470 transitions. [2022-03-15 19:01:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:13,332 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:13,332 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:13,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:13,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:13,550 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash -598915713, now seen corresponding path program 71 times [2022-03-15 19:01:13,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:13,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664895532] [2022-03-15 19:01:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:13,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:13,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664895532] [2022-03-15 19:01:13,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664895532] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:13,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597356093] [2022-03-15 19:01:13,707 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:01:13,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:13,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:13,724 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:13,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 19:01:13,872 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:01:13,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:13,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:13,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:14,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:15,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597356093] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:15,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:15,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 19:01:15,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664560271] [2022-03-15 19:01:15,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:15,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:15,888 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 306 transitions. [2022-03-15 19:01:15,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:18,617 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [154752#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 154758#(and (or (<= ~c1~0 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~c1~0)) (or (<= (+ 2 ~c1~0) 0) (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (<= 2 ~c1~0) (= (mod ~v_assert~0 256) 0))), 154754#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 154680#(not (<= (mod ~v_assert~0 256) 0)), 154751#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 0))), 154753#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 154757#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 2 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~c1~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0))), 154676#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 154756#(and (or (<= 3 ~c1~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~c1~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 154755#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 3 ~c1~0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~c1~0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:01:18,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:01:18,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:18,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:01:18,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:01:18,617 INFO L87 Difference]: Start difference. First operand 912 states and 2470 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:19,437 INFO L93 Difference]: Finished difference Result 1334 states and 3548 transitions. [2022-03-15 19:01:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:01:19,437 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:19,439 INFO L225 Difference]: With dead ends: 1334 [2022-03-15 19:01:19,439 INFO L226 Difference]: Without dead ends: 1264 [2022-03-15 19:01:19,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 116 SyntacticMatches, 39 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=579, Invalid=2961, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:01:19,440 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 293 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:19,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 0 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:01:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-03-15 19:01:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 960. [2022-03-15 19:01:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 2.713242961418144) internal successors, (2602), 959 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2602 transitions. [2022-03-15 19:01:19,450 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2602 transitions. Word has length 32 [2022-03-15 19:01:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:19,450 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 2602 transitions. [2022-03-15 19:01:19,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2602 transitions. [2022-03-15 19:01:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:19,452 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:19,452 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:19,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:19,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-03-15 19:01:19,668 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1909856028, now seen corresponding path program 72 times [2022-03-15 19:01:19,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:19,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64048351] [2022-03-15 19:01:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:19,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:19,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64048351] [2022-03-15 19:01:19,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64048351] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:19,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123278983] [2022-03-15 19:01:19,804 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:01:19,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:19,805 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:19,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 19:01:19,973 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:01:19,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:19,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:19,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:20,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:21,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123278983] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:21,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:21,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:01:21,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [525397843] [2022-03-15 19:01:21,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:21,859 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:21,894 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 262 transitions. [2022-03-15 19:01:21,895 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:23,717 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [158275#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 158278#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 158277#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 158276#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 158200#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 158204#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:01:23,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:01:23,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:23,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:01:23,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:01:23,718 INFO L87 Difference]: Start difference. First operand 960 states and 2602 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:24,234 INFO L93 Difference]: Finished difference Result 1182 states and 3174 transitions. [2022-03-15 19:01:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:01:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:24,236 INFO L225 Difference]: With dead ends: 1182 [2022-03-15 19:01:24,236 INFO L226 Difference]: Without dead ends: 1136 [2022-03-15 19:01:24,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 46 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=438, Invalid=2214, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:01:24,236 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:24,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-03-15 19:01:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 992. [2022-03-15 19:01:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 2.714429868819374) internal successors, (2690), 991 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2690 transitions. [2022-03-15 19:01:24,247 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2690 transitions. Word has length 32 [2022-03-15 19:01:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:24,247 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 2690 transitions. [2022-03-15 19:01:24,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2690 transitions. [2022-03-15 19:01:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:24,248 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:24,248 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:24,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-03-15 19:01:24,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:24,463 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1058681407, now seen corresponding path program 73 times [2022-03-15 19:01:24,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:24,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123723030] [2022-03-15 19:01:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:24,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:24,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123723030] [2022-03-15 19:01:24,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123723030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:24,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828949190] [2022-03-15 19:01:24,619 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:01:24,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:24,620 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:24,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 19:01:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:24,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:24,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:25,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:27,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828949190] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:27,516 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:27,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:01:27,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1172295413] [2022-03-15 19:01:27,516 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:27,519 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:27,601 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 306 transitions. [2022-03-15 19:01:27,601 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:31,514 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [161700#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 161699#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 161698#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 161704#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 161703#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 161625#(not (<= (mod ~v_assert~0 256) 0)), 161702#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 161621#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 161701#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 161697#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0)))] [2022-03-15 19:01:31,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:01:31,515 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:01:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:01:31,515 INFO L87 Difference]: Start difference. First operand 992 states and 2690 transitions. Second operand has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:32,354 INFO L93 Difference]: Finished difference Result 1262 states and 3375 transitions. [2022-03-15 19:01:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:01:32,354 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:32,356 INFO L225 Difference]: With dead ends: 1262 [2022-03-15 19:01:32,356 INFO L226 Difference]: Without dead ends: 1216 [2022-03-15 19:01:32,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 122 SyntacticMatches, 32 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=634, Invalid=3148, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:01:32,357 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:32,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-03-15 19:01:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1024. [2022-03-15 19:01:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 2.7155425219941347) internal successors, (2778), 1023 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2778 transitions. [2022-03-15 19:01:32,369 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2778 transitions. Word has length 32 [2022-03-15 19:01:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:32,369 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2778 transitions. [2022-03-15 19:01:32,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.636363636363637) internal successors, (102), 21 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2778 transitions. [2022-03-15 19:01:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:32,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:32,371 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:32,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:32,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:32,587 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1358461505, now seen corresponding path program 74 times [2022-03-15 19:01:32,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:32,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365217520] [2022-03-15 19:01:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:32,721 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:32,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365217520] [2022-03-15 19:01:32,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365217520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:32,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207945653] [2022-03-15 19:01:32,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:01:32,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:32,723 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 19:01:32,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:01:32,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:32,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:32,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:33,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:34,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207945653] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:34,981 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:34,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:01:34,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671993404] [2022-03-15 19:01:34,982 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:34,984 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:35,022 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 306 transitions. [2022-03-15 19:01:35,022 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:37,514 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [165280#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 165207#(not (<= (mod ~v_assert~0 256) 0)), 165282#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 165203#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 165283#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 165279#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 165281#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 165284#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:01:37,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:01:37,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:01:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:01:37,515 INFO L87 Difference]: Start difference. First operand 1024 states and 2778 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:38,095 INFO L93 Difference]: Finished difference Result 1230 states and 3306 transitions. [2022-03-15 19:01:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:01:38,096 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:01:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:38,097 INFO L225 Difference]: With dead ends: 1230 [2022-03-15 19:01:38,097 INFO L226 Difference]: Without dead ends: 1184 [2022-03-15 19:01:38,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 136 SyntacticMatches, 20 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=475, Invalid=2605, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:01:38,098 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 247 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:38,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 0 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-03-15 19:01:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1024. [2022-03-15 19:01:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 2.7155425219941347) internal successors, (2778), 1023 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2778 transitions. [2022-03-15 19:01:38,138 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2778 transitions. Word has length 32 [2022-03-15 19:01:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:38,138 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2778 transitions. [2022-03-15 19:01:38,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2778 transitions. [2022-03-15 19:01:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:38,139 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:38,140 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:38,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:38,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:38,356 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:38,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash -677800191, now seen corresponding path program 75 times [2022-03-15 19:01:38,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:38,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309568552] [2022-03-15 19:01:38,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:38,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:38,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:38,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309568552] [2022-03-15 19:01:38,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309568552] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:38,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930816144] [2022-03-15 19:01:38,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:01:38,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:38,548 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:38,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 19:01:38,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:01:38,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:38,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:38,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:39,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:41,713 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930816144] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:41,713 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:41,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:01:41,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667945161] [2022-03-15 19:01:41,714 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:41,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:41,753 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 284 transitions. [2022-03-15 19:01:41,753 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:45,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [168819#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 3 ~c1~0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~c1~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c2~0) (<= (+ ~c1~0 1) 0))), 168747#(not (<= (mod ~v_assert~0 256) 0)), 168822#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ 2 ~c1~0) 0) (<= 0 ~c2~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~c1~0)) (or (<= (+ 2 ~c1~0) 0) (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (<= 2 ~c1~0) (= (mod ~v_assert~0 256) 0))), 168820#(and (or (<= 3 ~c1~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~c1~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 0 ~c2~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 168743#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 168821#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 ~c2~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 2 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~c1~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)))] [2022-03-15 19:01:45,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:01:45,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:01:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:01:45,743 INFO L87 Difference]: Start difference. First operand 1024 states and 2778 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:46,346 INFO L93 Difference]: Finished difference Result 1198 states and 3218 transitions. [2022-03-15 19:01:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:01:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:46,347 INFO L225 Difference]: With dead ends: 1198 [2022-03-15 19:01:46,347 INFO L226 Difference]: Without dead ends: 1152 [2022-03-15 19:01:46,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 85 SyntacticMatches, 65 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=402, Invalid=2250, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:01:46,348 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:46,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:01:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-03-15 19:01:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1024. [2022-03-15 19:01:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 2.7155425219941347) internal successors, (2778), 1023 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2778 transitions. [2022-03-15 19:01:46,358 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2778 transitions. Word has length 32 [2022-03-15 19:01:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:46,358 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2778 transitions. [2022-03-15 19:01:46,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2778 transitions. [2022-03-15 19:01:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:46,359 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:46,359 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:46,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2022-03-15 19:01:46,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-03-15 19:01:46,576 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1704449954, now seen corresponding path program 76 times [2022-03-15 19:01:46,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:46,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595916142] [2022-03-15 19:01:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:46,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:46,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595916142] [2022-03-15 19:01:46,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595916142] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:46,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939230143] [2022-03-15 19:01:46,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:01:46,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:46,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:46,843 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:46,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 19:01:46,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:01:46,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:46,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:46,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:47,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:49,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939230143] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:49,757 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:49,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 19:01:49,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [464426060] [2022-03-15 19:01:49,757 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:49,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:49,820 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 306 transitions. [2022-03-15 19:01:49,821 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:53,595 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [172320#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0))), 172322#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 172321#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 172249#(not (<= (mod ~v_assert~0 256) 0)), 172245#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 172323#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:01:53,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:01:53,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:01:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:01:53,595 INFO L87 Difference]: Start difference. First operand 1024 states and 2778 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:54,576 INFO L93 Difference]: Finished difference Result 1302 states and 3456 transitions. [2022-03-15 19:01:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:01:54,576 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:54,578 INFO L225 Difference]: With dead ends: 1302 [2022-03-15 19:01:54,578 INFO L226 Difference]: Without dead ends: 1256 [2022-03-15 19:01:54,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 104 SyntacticMatches, 55 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=595, Invalid=3065, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:01:54,579 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:54,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:01:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2022-03-15 19:01:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1008. [2022-03-15 19:01:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 2.714995034756703) internal successors, (2734), 1007 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2734 transitions. [2022-03-15 19:01:54,591 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2734 transitions. Word has length 32 [2022-03-15 19:01:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:54,591 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 2734 transitions. [2022-03-15 19:01:54,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2734 transitions. [2022-03-15 19:01:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:54,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:54,593 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:54,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:54,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:54,799 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -463150543, now seen corresponding path program 77 times [2022-03-15 19:01:54,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:54,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181871500] [2022-03-15 19:01:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:54,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:54,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181871500] [2022-03-15 19:01:54,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181871500] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:54,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833110150] [2022-03-15 19:01:54,928 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:01:54,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:54,929 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:54,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 19:01:55,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:01:55,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:55,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:55,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:01:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:55,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:01:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:56,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833110150] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:01:56,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:01:56,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:01:56,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032976501] [2022-03-15 19:01:56,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:01:56,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:01:56,877 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 214 transitions. [2022-03-15 19:01:56,877 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:01:58,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [175843#(not (<= (mod ~v_assert~0 256) 0)), 175917#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 175839#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 175915#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0))), 175916#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 175918#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:01:58,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:01:58,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:01:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:01:58,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:01:58,503 INFO L87 Difference]: Start difference. First operand 1008 states and 2734 transitions. Second operand has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 17 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:01:59,060 INFO L93 Difference]: Finished difference Result 1262 states and 3394 transitions. [2022-03-15 19:01:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:01:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 17 states have internal predecessors, (80), 0 states have call successors, (0), 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 32 [2022-03-15 19:01:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:01:59,061 INFO L225 Difference]: With dead ends: 1262 [2022-03-15 19:01:59,061 INFO L226 Difference]: Without dead ends: 1216 [2022-03-15 19:01:59,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 109 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=621, Invalid=2919, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:01:59,062 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:01:59,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:01:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-03-15 19:01:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1040. [2022-03-15 19:01:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 2.716073147256978) internal successors, (2822), 1039 states have internal predecessors, (2822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2822 transitions. [2022-03-15 19:01:59,073 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2822 transitions. Word has length 32 [2022-03-15 19:01:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:01:59,073 INFO L470 AbstractCegarLoop]: Abstraction has 1040 states and 2822 transitions. [2022-03-15 19:01:59,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 17 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:01:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2822 transitions. [2022-03-15 19:01:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:01:59,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:01:59,075 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:01:59,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 19:01:59,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:59,292 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:01:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:01:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2101511132, now seen corresponding path program 78 times [2022-03-15 19:01:59,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:01:59,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22442189] [2022-03-15 19:01:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:01:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:01:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:01:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:01:59,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:01:59,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22442189] [2022-03-15 19:01:59,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22442189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:01:59,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720194266] [2022-03-15 19:01:59,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:01:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:01:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:01:59,431 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:01:59,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 19:01:59,616 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:01:59,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:01:59,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:01:59,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:00,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:01,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720194266] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:01,887 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:01,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:02:01,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430977443] [2022-03-15 19:02:01,887 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:01,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:01,927 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:02:01,928 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:04,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [179456#(not (<= (mod ~v_assert~0 256) 0)), 179534#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 179452#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 179533#(and (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 3) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0))), 179531#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 179529#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 179532#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 179535#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 179528#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 179530#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:02:04,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:02:04,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:04,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:02:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:02:04,505 INFO L87 Difference]: Start difference. First operand 1040 states and 2822 transitions. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:05,326 INFO L93 Difference]: Finished difference Result 1342 states and 3583 transitions. [2022-03-15 19:02:05,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:02:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:05,328 INFO L225 Difference]: With dead ends: 1342 [2022-03-15 19:02:05,328 INFO L226 Difference]: Without dead ends: 1248 [2022-03-15 19:02:05,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 109 SyntacticMatches, 40 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=601, Invalid=3431, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:02:05,329 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:05,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:02:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-03-15 19:02:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1072. [2022-03-15 19:02:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:02:05,340 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:02:05,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:05,340 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:02:05,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:02:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:05,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:05,341 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:05,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:05,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-03-15 19:02:05,547 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1495100739, now seen corresponding path program 79 times [2022-03-15 19:02:05,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:05,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543379035] [2022-03-15 19:02:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:05,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:05,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543379035] [2022-03-15 19:02:05,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543379035] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:05,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157523581] [2022-03-15 19:02:05,658 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:02:05,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:05,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:05,659 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:05,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 19:02:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:05,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:06,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:08,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157523581] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:08,610 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:08,610 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:02:08,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289693189] [2022-03-15 19:02:08,611 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:08,613 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:08,648 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 276 transitions. [2022-03-15 19:02:08,648 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:12,034 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [183289#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 183294#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 183292#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 183295#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 183212#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 183216#(not (<= (mod ~v_assert~0 256) 0)), 183293#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 183291#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 183290#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0))), 183288#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))))] [2022-03-15 19:02:12,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:02:12,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:02:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:02:12,035 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:12,999 INFO L93 Difference]: Finished difference Result 1294 states and 3463 transitions. [2022-03-15 19:02:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:02:12,999 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:13,001 INFO L225 Difference]: With dead ends: 1294 [2022-03-15 19:02:13,001 INFO L226 Difference]: Without dead ends: 1248 [2022-03-15 19:02:13,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 129 SyntacticMatches, 13 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=620, Invalid=3162, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:02:13,002 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:13,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:02:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-03-15 19:02:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1072. [2022-03-15 19:02:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:02:13,012 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:02:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:13,013 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:02:13,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.681818181818182) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:02:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:13,014 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:13,014 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:13,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-03-15 19:02:13,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:13,227 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 157194468, now seen corresponding path program 80 times [2022-03-15 19:02:13,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:13,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564546763] [2022-03-15 19:02:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:13,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:13,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564546763] [2022-03-15 19:02:13,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564546763] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:13,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673747726] [2022-03-15 19:02:13,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:13,361 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:13,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 19:02:13,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:13,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:13,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:13,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:14,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:15,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673747726] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:15,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:15,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:02:15,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125830236] [2022-03-15 19:02:15,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:15,759 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:15,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 276 transitions. [2022-03-15 19:02:15,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:18,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [187000#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 187001#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 187003#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 186923#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 187004#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 186927#(not (<= (mod ~v_assert~0 256) 0)), 186999#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2))), 187002#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 3) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:02:18,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:02:18,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:02:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:02:18,480 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:19,223 INFO L93 Difference]: Finished difference Result 1366 states and 3655 transitions. [2022-03-15 19:02:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:02:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:19,225 INFO L225 Difference]: With dead ends: 1366 [2022-03-15 19:02:19,225 INFO L226 Difference]: Without dead ends: 1296 [2022-03-15 19:02:19,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=564, Invalid=3096, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:02:19,226 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:19,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-03-15 19:02:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1072. [2022-03-15 19:02:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:02:19,237 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:02:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:19,237 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:02:19,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:02:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:19,238 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:19,238 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:19,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:19,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:19,453 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1169235393, now seen corresponding path program 81 times [2022-03-15 19:02:19,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:19,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585112115] [2022-03-15 19:02:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:19,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:19,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:19,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585112115] [2022-03-15 19:02:19,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585112115] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:19,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692039309] [2022-03-15 19:02:19,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:02:19,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:19,631 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:19,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 19:02:19,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:02:19,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:19,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:19,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:20,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:22,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692039309] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:22,424 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:22,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:02:22,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842312083] [2022-03-15 19:02:22,425 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:22,427 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:22,463 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:02:22,463 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:25,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [190703#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 190779#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 190780#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 190707#(not (<= (mod ~v_assert~0 256) 0)), 190783#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 190782#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 190784#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 190785#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 190781#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 190786#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:02:25,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:02:25,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:02:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:02:25,588 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:26,361 INFO L93 Difference]: Finished difference Result 1358 states and 3620 transitions. [2022-03-15 19:02:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:02:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:26,363 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:02:26,363 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:02:26,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 118 SyntacticMatches, 32 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=512, Invalid=2910, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:02:26,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:26,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:02:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1072. [2022-03-15 19:02:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:02:26,375 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:02:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:26,375 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:02:26,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:02:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:26,377 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:26,377 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:26,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:26,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-03-15 19:02:26,591 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash -869455295, now seen corresponding path program 82 times [2022-03-15 19:02:26,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:26,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292596777] [2022-03-15 19:02:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:26,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:26,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292596777] [2022-03-15 19:02:26,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292596777] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:26,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855986498] [2022-03-15 19:02:26,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:02:26,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:26,742 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:26,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 19:02:26,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:02:26,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:26,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:26,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:27,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:29,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855986498] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:29,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:29,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 19:02:29,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675631264] [2022-03-15 19:02:29,499 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:29,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:29,538 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:02:29,538 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:31,806 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [194549#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 194548#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 194475#(not (<= (mod ~v_assert~0 256) 0)), 194550#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 194471#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 194546#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 194547#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 194551#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:02:31,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:02:31,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:02:31,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:02:31,807 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:32,345 INFO L93 Difference]: Finished difference Result 1278 states and 3419 transitions. [2022-03-15 19:02:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:02:32,345 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:32,347 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:02:32,347 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:02:32,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=2362, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:02:32,368 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:32,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:02:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1072. [2022-03-15 19:02:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:02:32,379 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:02:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:32,379 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:02:32,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:02:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:32,380 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:32,381 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:32,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:32,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:32,581 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:32,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1814791588, now seen corresponding path program 83 times [2022-03-15 19:02:32,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:32,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252835691] [2022-03-15 19:02:32,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:32,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:32,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:32,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252835691] [2022-03-15 19:02:32,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252835691] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:32,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921975524] [2022-03-15 19:02:32,677 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:02:32,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:32,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:32,678 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:32,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 19:02:32,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:02:32,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:32,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:32,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:33,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:34,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921975524] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:34,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:34,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:02:34,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285112114] [2022-03-15 19:02:34,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:34,570 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:34,602 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 254 transitions. [2022-03-15 19:02:34,602 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:36,136 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [198227#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 198228#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0))), 198229#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 198155#(not (<= (mod ~v_assert~0 256) 0)), 198151#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 198230#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:02:36,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:02:36,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:02:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=979, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:02:36,137 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:36,610 INFO L93 Difference]: Finished difference Result 1262 states and 3375 transitions. [2022-03-15 19:02:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:02:36,610 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:36,612 INFO L225 Difference]: With dead ends: 1262 [2022-03-15 19:02:36,612 INFO L226 Difference]: Without dead ends: 1216 [2022-03-15 19:02:36,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 103 SyntacticMatches, 34 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:02:36,613 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 207 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:36,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 8 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:02:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2022-03-15 19:02:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1088. [2022-03-15 19:02:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 2.717571297148114) internal successors, (2954), 1087 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2954 transitions. [2022-03-15 19:02:36,627 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2954 transitions. Word has length 32 [2022-03-15 19:02:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:36,627 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 2954 transitions. [2022-03-15 19:02:36,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2954 transitions. [2022-03-15 19:02:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:36,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:36,629 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:36,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-03-15 19:02:36,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:36,841 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:36,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash 488361727, now seen corresponding path program 84 times [2022-03-15 19:02:36,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:36,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385948489] [2022-03-15 19:02:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:37,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:37,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385948489] [2022-03-15 19:02:37,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385948489] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:37,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832647372] [2022-03-15 19:02:37,004 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:02:37,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:37,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:37,036 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:37,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 19:02:37,207 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:02:37,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:37,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:37,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:37,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:39,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832647372] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:39,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:39,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:02:39,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1549672208] [2022-03-15 19:02:39,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:39,254 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:39,292 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:02:39,292 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:42,510 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [201928#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 201924#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 201923#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 201847#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 201927#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 201930#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 201851#(not (<= (mod ~v_assert~0 256) 0)), 201929#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 201925#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 201926#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)))] [2022-03-15 19:02:42,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:02:42,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:02:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:02:42,511 INFO L87 Difference]: Start difference. First operand 1088 states and 2954 transitions. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:43,266 INFO L93 Difference]: Finished difference Result 1406 states and 3752 transitions. [2022-03-15 19:02:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:02:43,266 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:43,268 INFO L225 Difference]: With dead ends: 1406 [2022-03-15 19:02:43,268 INFO L226 Difference]: Without dead ends: 1360 [2022-03-15 19:02:43,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 105 SyntacticMatches, 45 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=596, Invalid=3186, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:02:43,269 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 276 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:43,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 11 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-03-15 19:02:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1088. [2022-03-15 19:02:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 2.717571297148114) internal successors, (2954), 1087 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2954 transitions. [2022-03-15 19:02:43,280 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2954 transitions. Word has length 32 [2022-03-15 19:02:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:43,280 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 2954 transitions. [2022-03-15 19:02:43,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2954 transitions. [2022-03-15 19:02:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:43,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:43,281 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:43,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:43,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:43,499 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash 788141825, now seen corresponding path program 85 times [2022-03-15 19:02:43,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:43,501 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944135984] [2022-03-15 19:02:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:43,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:43,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944135984] [2022-03-15 19:02:43,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944135984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:43,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838194743] [2022-03-15 19:02:43,685 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:02:43,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:43,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:43,686 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:43,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 19:02:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:43,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:43,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:44,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:45,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838194743] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:45,963 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:45,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:02:45,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395571587] [2022-03-15 19:02:45,963 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:45,997 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:46,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:02:46,035 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:49,652 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [205778#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 205781#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (= (+ ~pos~0 2) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (+ 2 ~c1~0) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0))), 205701#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 205782#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (= (+ ~pos~0 2) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 205777#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 205705#(not (<= (mod ~v_assert~0 256) 0)), 205779#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 205780#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:02:49,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:02:49,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:02:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:02:49,653 INFO L87 Difference]: Start difference. First operand 1088 states and 2954 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:50,465 INFO L93 Difference]: Finished difference Result 1326 states and 3551 transitions. [2022-03-15 19:02:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:02:50,466 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:50,468 INFO L225 Difference]: With dead ends: 1326 [2022-03-15 19:02:50,468 INFO L226 Difference]: Without dead ends: 1280 [2022-03-15 19:02:50,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 136 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=2443, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:02:50,468 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 190 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:50,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 18 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:02:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-03-15 19:02:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1088. [2022-03-15 19:02:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 2.717571297148114) internal successors, (2954), 1087 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2954 transitions. [2022-03-15 19:02:50,479 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2954 transitions. Word has length 32 [2022-03-15 19:02:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:50,479 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 2954 transitions. [2022-03-15 19:02:50,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2954 transitions. [2022-03-15 19:02:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:50,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:50,481 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:50,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-03-15 19:02:50,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable93 [2022-03-15 19:02:50,700 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1248119871, now seen corresponding path program 86 times [2022-03-15 19:02:50,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:50,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758269301] [2022-03-15 19:02:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:50,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:50,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758269301] [2022-03-15 19:02:50,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758269301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:50,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776405135] [2022-03-15 19:02:50,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:02:50,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:50,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:50,860 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:50,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 19:02:51,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:02:51,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:51,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:51,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:51,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:02:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:53,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776405135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:02:53,741 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:02:53,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:02:53,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459066221] [2022-03-15 19:02:53,741 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:02:53,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:02:53,780 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 276 transitions. [2022-03-15 19:02:53,780 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:02:56,147 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [209537#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 209540#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 209465#(not (<= (mod ~v_assert~0 256) 0)), 209538#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 209461#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 209539#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 19:02:56,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:02:56,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:02:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:02:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:02:56,148 INFO L87 Difference]: Start difference. First operand 1088 states and 2954 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:02:56,715 INFO L93 Difference]: Finished difference Result 1278 states and 3419 transitions. [2022-03-15 19:02:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:02:56,716 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 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 32 [2022-03-15 19:02:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:02:56,717 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:02:56,717 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:02:56,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 119 SyntacticMatches, 27 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=2251, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:02:56,718 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 185 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:02:56,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 12 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:02:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:02:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1104. [2022-03-15 19:02:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:02:56,744 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:02:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:02:56,744 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:02:56,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:02:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:02:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:02:56,746 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:02:56,746 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:02:56,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-03-15 19:02:56,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:56,963 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:02:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:02:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2020197662, now seen corresponding path program 87 times [2022-03-15 19:02:56,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:02:56,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231016731] [2022-03-15 19:02:56,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:02:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:02:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:02:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:57,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:02:57,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231016731] [2022-03-15 19:02:57,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231016731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:02:57,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889411766] [2022-03-15 19:02:57,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:02:57,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:02:57,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:02:57,127 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:02:57,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 19:02:57,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:02:57,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:02:57,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:02:57,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:02:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:02:58,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:00,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889411766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:00,055 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:00,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:00,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1627254292] [2022-03-15 19:03:00,056 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:00,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:00,095 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:03:00,095 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:04,232 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [213279#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 3 ~c1~0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~c2~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c1~0 1) ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~c1~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 213282#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0))), 213280#(and (or (<= 3 ~c1~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~c2~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 1 ~c1~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= (+ ~c1~0 1) ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 213203#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 213207#(not (<= (mod ~v_assert~0 256) 0)), 213281#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c1~0)))] [2022-03-15 19:03:04,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:03:04,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:04,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:03:04,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:03:04,232 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:04,924 INFO L93 Difference]: Finished difference Result 1286 states and 3479 transitions. [2022-03-15 19:03:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:03:04,924 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:04,926 INFO L225 Difference]: With dead ends: 1286 [2022-03-15 19:03:04,926 INFO L226 Difference]: Without dead ends: 1240 [2022-03-15 19:03:04,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 97 SyntacticMatches, 57 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=456, Invalid=2406, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:03:04,927 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 178 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:04,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 12 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-03-15 19:03:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1072. [2022-03-15 19:03:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:03:04,937 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:03:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:04,937 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:03:04,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:03:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:04,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:04,939 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:04,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:05,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:05,154 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 456478643, now seen corresponding path program 88 times [2022-03-15 19:03:05,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:05,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742471520] [2022-03-15 19:03:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:05,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:05,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742471520] [2022-03-15 19:03:05,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742471520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:05,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450239054] [2022-03-15 19:03:05,278 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:03:05,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:05,280 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:05,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 19:03:05,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:03:05,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:05,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:05,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:05,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:07,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450239054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:07,270 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:07,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:03:07,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410896245] [2022-03-15 19:03:07,271 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:07,273 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:07,304 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 232 transitions. [2022-03-15 19:03:07,304 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:08,753 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [216972#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 216894#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 216970#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 216898#(not (<= (mod ~v_assert~0 256) 0)), 216971#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 216973#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:03:08,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:03:08,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:08,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:03:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:03:08,754 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:09,281 INFO L93 Difference]: Finished difference Result 1358 states and 3639 transitions. [2022-03-15 19:03:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:03:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:09,282 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:03:09,282 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:03:09,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 99 SyntacticMatches, 30 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=578, Invalid=2728, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:03:09,283 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 194 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:09,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 8 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:03:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:03:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1072. [2022-03-15 19:03:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 2.7170868347338937) internal successors, (2910), 1071 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 2910 transitions. [2022-03-15 19:03:09,294 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 2910 transitions. Word has length 32 [2022-03-15 19:03:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:09,294 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 2910 transitions. [2022-03-15 19:03:09,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 2910 transitions. [2022-03-15 19:03:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:09,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:09,296 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:09,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:09,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:09,511 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1332757092, now seen corresponding path program 89 times [2022-03-15 19:03:09,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:09,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532557475] [2022-03-15 19:03:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:09,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:09,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:09,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532557475] [2022-03-15 19:03:09,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532557475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:09,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696192057] [2022-03-15 19:03:09,650 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:03:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:09,651 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:09,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 19:03:09,811 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:03:09,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:09,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:09,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:10,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:11,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696192057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:11,416 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:11,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:03:11,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557775460] [2022-03-15 19:03:11,416 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:11,419 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:11,454 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 232 transitions. [2022-03-15 19:03:11,454 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:12,753 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [220667#(not (<= (mod ~v_assert~0 256) 0)), 220740#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 220739#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c1~0))), 220663#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:03:12,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:03:12,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:12,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:03:12,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:03:12,754 INFO L87 Difference]: Start difference. First operand 1072 states and 2910 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:13,119 INFO L93 Difference]: Finished difference Result 1214 states and 3262 transitions. [2022-03-15 19:03:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:03:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:13,121 INFO L225 Difference]: With dead ends: 1214 [2022-03-15 19:03:13,121 INFO L226 Difference]: Without dead ends: 1168 [2022-03-15 19:03:13,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 111 SyntacticMatches, 20 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=1945, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:03:13,121 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:13,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 8 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:03:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-03-15 19:03:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1104. [2022-03-15 19:03:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:03:13,132 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:03:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:13,132 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:03:13,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:03:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:13,133 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:13,133 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:13,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:13,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:13,351 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash 6327231, now seen corresponding path program 90 times [2022-03-15 19:03:13,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:13,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591927686] [2022-03-15 19:03:13,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:13,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:13,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591927686] [2022-03-15 19:03:13,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591927686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:13,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703768260] [2022-03-15 19:03:13,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:13,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:13,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:13,457 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 19:03:13,657 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:03:13,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:13,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:13,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:14,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:15,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703768260] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:15,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:15,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:15,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671836717] [2022-03-15 19:03:15,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:15,723 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:15,760 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:03:15,760 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:20,898 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [224335#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 224412#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 224418#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 224415#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 224339#(not (<= (mod ~v_assert~0 256) 0)), 224416#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 224414#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 224411#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 224413#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 224417#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 19:03:20,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:03:20,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:20,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:03:20,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:03:20,899 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:22,113 INFO L93 Difference]: Finished difference Result 1374 states and 3683 transitions. [2022-03-15 19:03:22,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:03:22,113 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:22,115 INFO L225 Difference]: With dead ends: 1374 [2022-03-15 19:03:22,115 INFO L226 Difference]: Without dead ends: 1328 [2022-03-15 19:03:22,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 124 SyntacticMatches, 26 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=700, Invalid=3206, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:03:22,116 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 247 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:22,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 7 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:03:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-03-15 19:03:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1120. [2022-03-15 19:03:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 2.7184986595174263) internal successors, (3042), 1119 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 3042 transitions. [2022-03-15 19:03:22,127 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 3042 transitions. Word has length 32 [2022-03-15 19:03:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:22,127 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 3042 transitions. [2022-03-15 19:03:22,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 21 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3042 transitions. [2022-03-15 19:03:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:22,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:22,128 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:22,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2022-03-15 19:03:22,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-03-15 19:03:22,330 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 306107329, now seen corresponding path program 91 times [2022-03-15 19:03:22,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:22,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16859018] [2022-03-15 19:03:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:22,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:22,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16859018] [2022-03-15 19:03:22,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16859018] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:22,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209638549] [2022-03-15 19:03:22,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:03:22,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:22,527 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:22,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 19:03:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:22,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:22,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:23,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:25,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209638549] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:25,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:25,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:25,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481562987] [2022-03-15 19:03:25,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:25,528 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:25,565 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:03:25,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:28,699 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [228299#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 228303#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c1~0))), 228301#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 228300#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 228227#(not (<= (mod ~v_assert~0 256) 0)), 228302#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 228223#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 228304#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:03:28,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:03:28,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:03:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:03:28,700 INFO L87 Difference]: Start difference. First operand 1120 states and 3042 transitions. Second operand has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:29,249 INFO L93 Difference]: Finished difference Result 1278 states and 3438 transitions. [2022-03-15 19:03:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:03:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:29,251 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:03:29,251 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:03:29,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 133 SyntacticMatches, 19 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=418, Invalid=2234, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:03:29,252 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:29,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:03:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1120. [2022-03-15 19:03:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 2.7184986595174263) internal successors, (3042), 1119 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 3042 transitions. [2022-03-15 19:03:29,263 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 3042 transitions. Word has length 32 [2022-03-15 19:03:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:29,263 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 3042 transitions. [2022-03-15 19:03:29,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.75) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3042 transitions. [2022-03-15 19:03:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:29,264 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:29,264 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:29,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-03-15 19:03:29,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-03-15 19:03:29,485 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1730154367, now seen corresponding path program 92 times [2022-03-15 19:03:29,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:29,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832062129] [2022-03-15 19:03:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:29,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:29,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832062129] [2022-03-15 19:03:29,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832062129] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:29,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765977821] [2022-03-15 19:03:29,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:03:29,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:29,612 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:29,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 19:03:29,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:03:29,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:29,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:29,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:30,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:31,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765977821] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:31,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:31,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:31,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514681705] [2022-03-15 19:03:31,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:31,677 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:31,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 276 transitions. [2022-03-15 19:03:31,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:33,795 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [231999#(not (<= (mod ~v_assert~0 256) 0)), 232071#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 232073#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 232074#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 231995#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 232072#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:03:33,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:03:33,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:33,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:03:33,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:03:33,796 INFO L87 Difference]: Start difference. First operand 1120 states and 3042 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:34,466 INFO L93 Difference]: Finished difference Result 1310 states and 3526 transitions. [2022-03-15 19:03:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:03:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:34,468 INFO L225 Difference]: With dead ends: 1310 [2022-03-15 19:03:34,468 INFO L226 Difference]: Without dead ends: 1264 [2022-03-15 19:03:34,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 117 SyntacticMatches, 29 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=382, Invalid=2068, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:03:34,468 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 141 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:34,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 16 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:03:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-03-15 19:03:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1136. [2022-03-15 19:03:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 2.718942731277533) internal successors, (3086), 1135 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 3086 transitions. [2022-03-15 19:03:34,480 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 3086 transitions. Word has length 32 [2022-03-15 19:03:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:34,480 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 3086 transitions. [2022-03-15 19:03:34,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 3086 transitions. [2022-03-15 19:03:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:34,481 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:34,481 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:34,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-03-15 19:03:34,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-03-15 19:03:34,695 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1538163166, now seen corresponding path program 93 times [2022-03-15 19:03:34,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:34,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739598420] [2022-03-15 19:03:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:34,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:34,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739598420] [2022-03-15 19:03:34,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739598420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:34,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440096535] [2022-03-15 19:03:34,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:03:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:34,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:34,807 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:34,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 19:03:35,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:03:35,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:35,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:35,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:35,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:37,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440096535] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:37,837 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:37,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:37,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484622018] [2022-03-15 19:03:37,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:37,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:37,875 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:03:37,875 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:40,754 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [235905#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 235829#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 235833#(not (<= (mod ~v_assert~0 256) 0)), 235906#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 235908#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 235907#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 19:03:40,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:03:40,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:40,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:03:40,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:03:40,755 INFO L87 Difference]: Start difference. First operand 1136 states and 3086 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:41,230 INFO L93 Difference]: Finished difference Result 1310 states and 3526 transitions. [2022-03-15 19:03:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:03:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:41,232 INFO L225 Difference]: With dead ends: 1310 [2022-03-15 19:03:41,232 INFO L226 Difference]: Without dead ends: 1264 [2022-03-15 19:03:41,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 125 SyntacticMatches, 29 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=419, Invalid=2233, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:03:41,232 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 181 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:41,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 12 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:03:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-03-15 19:03:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1104. [2022-03-15 19:03:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:03:41,243 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:03:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:41,243 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:03:41,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:03:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:41,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:41,244 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:41,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:41,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:41,446 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:41,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:41,446 INFO L85 PathProgramCache]: Analyzing trace with hash -116781515, now seen corresponding path program 94 times [2022-03-15 19:03:41,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:41,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919981531] [2022-03-15 19:03:41,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:41,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:41,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:41,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919981531] [2022-03-15 19:03:41,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919981531] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:41,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602750732] [2022-03-15 19:03:41,580 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:03:41,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:41,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:41,596 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:41,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 19:03:41,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:03:41,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:41,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:41,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:42,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:43,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602750732] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:43,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:43,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:03:43,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207450306] [2022-03-15 19:03:43,900 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:43,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:43,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 254 transitions. [2022-03-15 19:03:43,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:46,185 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [239608#(not (<= (mod ~v_assert~0 256) 0)), 239680#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 239683#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 239681#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 239682#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 239604#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:03:46,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:03:46,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:46,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:03:46,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:03:46,185 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:46,738 INFO L93 Difference]: Finished difference Result 1342 states and 3595 transitions. [2022-03-15 19:03:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:03:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:46,740 INFO L225 Difference]: With dead ends: 1342 [2022-03-15 19:03:46,740 INFO L226 Difference]: Without dead ends: 1296 [2022-03-15 19:03:46,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 104 SyntacticMatches, 33 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1571 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=535, Invalid=2435, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:03:46,741 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 193 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:46,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 5 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:03:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-03-15 19:03:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1104. [2022-03-15 19:03:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:03:46,756 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:03:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:46,756 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:03:46,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:03:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:46,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:46,758 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:46,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-03-15 19:03:46,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 19:03:46,971 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:46,971 INFO L85 PathProgramCache]: Analyzing trace with hash -72557247, now seen corresponding path program 95 times [2022-03-15 19:03:46,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:46,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072794546] [2022-03-15 19:03:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:47,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:47,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072794546] [2022-03-15 19:03:47,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072794546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:47,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840383245] [2022-03-15 19:03:47,103 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:03:47,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:47,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:47,104 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:47,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 19:03:47,273 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:03:47,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:47,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:47,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:49,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840383245] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:49,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:49,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:49,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [698841119] [2022-03-15 19:03:49,758 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:49,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:49,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 254 transitions. [2022-03-15 19:03:49,793 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:51,412 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [243414#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 243491#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 243490#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 243418#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:03:51,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:03:51,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:03:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:03:51,413 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:51,741 INFO L93 Difference]: Finished difference Result 1278 states and 3438 transitions. [2022-03-15 19:03:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:03:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:51,743 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:03:51,743 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:03:51,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 111 SyntacticMatches, 29 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=368, Invalid=1794, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:03:51,744 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 110 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:51,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 7 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:03:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:03:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1120. [2022-03-15 19:03:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 2.7184986595174263) internal successors, (3042), 1119 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 3042 transitions. [2022-03-15 19:03:51,754 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 3042 transitions. Word has length 32 [2022-03-15 19:03:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:51,754 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 3042 transitions. [2022-03-15 19:03:51,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3042 transitions. [2022-03-15 19:03:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:51,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:51,755 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:51,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-03-15 19:03:51,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 19:03:51,971 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1099207010, now seen corresponding path program 96 times [2022-03-15 19:03:51,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:51,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102745784] [2022-03-15 19:03:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:52,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:52,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102745784] [2022-03-15 19:03:52,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102745784] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:52,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983415162] [2022-03-15 19:03:52,081 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:03:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:52,082 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:52,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 19:03:52,262 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:03:52,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:03:52,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:52,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:52,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:03:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:55,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983415162] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:03:55,115 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:03:55,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:03:55,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653103852] [2022-03-15 19:03:55,119 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:03:55,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:03:55,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:03:55,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:03:57,926 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [247258#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 247259#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 247184#(not (<= (mod ~v_assert~0 256) 0)), 247257#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 247180#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 247256#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 19:03:57,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:03:57,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:03:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:03:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:03:57,926 INFO L87 Difference]: Start difference. First operand 1120 states and 3042 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:03:58,559 INFO L93 Difference]: Finished difference Result 1310 states and 3507 transitions. [2022-03-15 19:03:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:03:58,560 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:03:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:03:58,561 INFO L225 Difference]: With dead ends: 1310 [2022-03-15 19:03:58,561 INFO L226 Difference]: Without dead ends: 1264 [2022-03-15 19:03:58,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 107 SyntacticMatches, 47 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1626 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:03:58,562 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 167 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:03:58,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 12 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:03:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2022-03-15 19:03:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1104. [2022-03-15 19:03:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:03:58,573 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:03:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:03:58,573 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:03:58,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:03:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:03:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:03:58,574 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:03:58,574 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:03:58,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-03-15 19:03:58,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:58,787 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:03:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:03:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash -492796617, now seen corresponding path program 97 times [2022-03-15 19:03:58,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:03:58,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714364019] [2022-03-15 19:03:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:03:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:03:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:59,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:03:59,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714364019] [2022-03-15 19:03:59,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714364019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:03:59,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914852107] [2022-03-15 19:03:59,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:03:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:03:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:03:59,224 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:03:59,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 19:03:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:03:59,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:03:59,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:03:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:03:59,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:01,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914852107] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:01,424 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:01,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-03-15 19:04:01,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17849168] [2022-03-15 19:04:01,425 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:01,428 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:01,464 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 276 transitions. [2022-03-15 19:04:01,464 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:03,683 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [250958#(not (<= (mod ~v_assert~0 256) 0)), 251032#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 251030#(and (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= ~c2~0 1) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) 0) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 250954#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 251031#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 251029#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2))) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0)))] [2022-03-15 19:04:03,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:04:03,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:04:03,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:04:03,684 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:04,282 INFO L93 Difference]: Finished difference Result 1326 states and 3551 transitions. [2022-03-15 19:04:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:04:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 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 32 [2022-03-15 19:04:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:04,284 INFO L225 Difference]: With dead ends: 1326 [2022-03-15 19:04:04,284 INFO L226 Difference]: Without dead ends: 1280 [2022-03-15 19:04:04,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 131 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=506, Invalid=2356, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:04:04,285 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 174 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:04,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 8 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:04:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-03-15 19:04:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1104. [2022-03-15 19:04:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:04:04,296 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:04:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:04,296 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:04:04,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:04:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:04,297 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:04,297 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:04,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:04,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:04,507 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1159498590, now seen corresponding path program 98 times [2022-03-15 19:04:04,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:04,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088015060] [2022-03-15 19:04:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:04,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:04,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:04,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088015060] [2022-03-15 19:04:04,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088015060] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:04,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143382408] [2022-03-15 19:04:04,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:04:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:04,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:04,646 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:04,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 19:04:04,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:04:04,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:04,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:04,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:05,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:07,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143382408] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:07,124 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:07,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:04:07,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541937] [2022-03-15 19:04:07,124 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:07,127 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:07,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 276 transitions. [2022-03-15 19:04:07,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:08,817 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [254826#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 254749#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 254825#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 254753#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:04:08,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:04:08,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:04:08,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:04:08,817 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:09,207 INFO L93 Difference]: Finished difference Result 1278 states and 3438 transitions. [2022-03-15 19:04:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:04:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 32 [2022-03-15 19:04:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:09,209 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:04:09,209 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:04:09,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 133 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1935, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:04:09,209 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 136 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:09,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 8 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:04:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:04:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1104. [2022-03-15 19:04:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:04:09,229 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:04:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:09,229 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:04:09,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:04:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:09,230 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:09,231 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:09,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:09,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-03-15 19:04:09,448 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:09,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash -166931271, now seen corresponding path program 99 times [2022-03-15 19:04:09,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:09,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933779040] [2022-03-15 19:04:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:09,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:09,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933779040] [2022-03-15 19:04:09,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933779040] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:09,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903436008] [2022-03-15 19:04:09,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:04:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:09,570 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:09,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 19:04:09,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:04:09,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:09,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:09,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:10,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:11,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903436008] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:11,872 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:11,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:04:11,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276941608] [2022-03-15 19:04:11,872 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:11,874 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:11,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:04:11,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:14,998 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [258492#(not (<= (mod ~v_assert~0 256) 0)), 258565#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 258488#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 258567#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c2~0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 258564#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 258566#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c2~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 19:04:14,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:04:14,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:14,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:04:14,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:04:14,998 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:15,553 INFO L93 Difference]: Finished difference Result 1294 states and 3463 transitions. [2022-03-15 19:04:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:04:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:04:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:15,555 INFO L225 Difference]: With dead ends: 1294 [2022-03-15 19:04:15,555 INFO L226 Difference]: Without dead ends: 1248 [2022-03-15 19:04:15,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 121 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=475, Invalid=2177, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:04:15,555 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 156 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:15,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 6 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:04:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-03-15 19:04:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1104. [2022-03-15 19:04:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:04:15,566 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:04:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:15,566 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:04:15,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:04:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:15,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:15,567 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:15,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:15,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:15,784 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash 132848827, now seen corresponding path program 100 times [2022-03-15 19:04:15,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:15,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537821682] [2022-03-15 19:04:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:15,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:15,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537821682] [2022-03-15 19:04:15,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537821682] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:15,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254353404] [2022-03-15 19:04:15,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:04:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:15,918 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:15,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 19:04:16,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:04:16,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:16,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:16,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:16,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:18,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254353404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:18,391 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:18,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:04:18,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868355377] [2022-03-15 19:04:18,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:18,394 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:18,434 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 298 transitions. [2022-03-15 19:04:18,434 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:20,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [262248#(not (<= (mod ~v_assert~0 256) 0)), 262244#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 262321#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 262320#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)))] [2022-03-15 19:04:20,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:04:20,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:20,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:04:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:04:20,790 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:21,256 INFO L93 Difference]: Finished difference Result 1246 states and 3350 transitions. [2022-03-15 19:04:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:04:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 32 [2022-03-15 19:04:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:21,258 INFO L225 Difference]: With dead ends: 1246 [2022-03-15 19:04:21,258 INFO L226 Difference]: Without dead ends: 1200 [2022-03-15 19:04:21,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 SyntacticMatches, 55 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1721 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:04:21,258 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 96 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:21,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 10 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-03-15 19:04:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1088. [2022-03-15 19:04:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 2.717571297148114) internal successors, (2954), 1087 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2954 transitions. [2022-03-15 19:04:21,269 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2954 transitions. Word has length 32 [2022-03-15 19:04:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:21,269 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 2954 transitions. [2022-03-15 19:04:21,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2954 transitions. [2022-03-15 19:04:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:21,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:21,270 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:21,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2022-03-15 19:04:21,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:21,479 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 509366015, now seen corresponding path program 101 times [2022-03-15 19:04:21,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:21,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253273857] [2022-03-15 19:04:21,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:21,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:21,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253273857] [2022-03-15 19:04:21,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253273857] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:21,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161880761] [2022-03-15 19:04:21,623 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:04:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:21,624 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:21,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 19:04:21,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:04:21,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:21,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:21,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:22,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:24,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161880761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:24,429 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:24,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:04:24,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1608423457] [2022-03-15 19:04:24,429 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:24,431 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:24,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:04:24,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:28,512 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [265918#(not (<= (mod ~v_assert~0 256) 0)), 265914#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 265997#(and (or (<= ~c2~0 1) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0))), 265992#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 265994#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 265996#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0))), 265990#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 265993#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 265995#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 265991#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:04:28,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:04:28,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:04:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:04:28,513 INFO L87 Difference]: Start difference. First operand 1088 states and 2954 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:29,532 INFO L93 Difference]: Finished difference Result 1358 states and 3658 transitions. [2022-03-15 19:04:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:04:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:04:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:29,534 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:04:29,534 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:04:29,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=567, Invalid=2973, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:04:29,535 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:29,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:04:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:04:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1088. [2022-03-15 19:04:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 2.717571297148114) internal successors, (2954), 1087 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2954 transitions. [2022-03-15 19:04:29,546 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2954 transitions. Word has length 32 [2022-03-15 19:04:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:29,546 INFO L470 AbstractCegarLoop]: Abstraction has 1088 states and 2954 transitions. [2022-03-15 19:04:29,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2954 transitions. [2022-03-15 19:04:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:29,547 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:29,547 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:29,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:29,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable109 [2022-03-15 19:04:29,764 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:29,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash -801574300, now seen corresponding path program 102 times [2022-03-15 19:04:29,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:29,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586937466] [2022-03-15 19:04:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:29,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:29,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586937466] [2022-03-15 19:04:29,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586937466] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:29,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188424863] [2022-03-15 19:04:29,856 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:04:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:29,857 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:29,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-03-15 19:04:30,049 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:04:30,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:30,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:30,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:30,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:32,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188424863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:32,118 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:32,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:04:32,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [86892637] [2022-03-15 19:04:32,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:32,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:32,170 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 246 transitions. [2022-03-15 19:04:32,170 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:34,634 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [269794#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 269795#(and (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0))), 269709#(not (<= (mod ~v_assert~0 256) 0)), 269793#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 269797#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 269796#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:04:34,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:04:34,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:04:34,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:04:34,635 INFO L87 Difference]: Start difference. First operand 1088 states and 2954 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:35,265 INFO L93 Difference]: Finished difference Result 1278 states and 3438 transitions. [2022-03-15 19:04:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:04:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:04:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:35,268 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:04:35,268 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:04:35,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 95 SyntacticMatches, 37 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=489, Invalid=2481, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:04:35,268 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:35,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:04:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1104. [2022-03-15 19:04:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1103 states have (on average 2.7180417044424297) internal successors, (2998), 1103 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2998 transitions. [2022-03-15 19:04:35,279 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2998 transitions. Word has length 32 [2022-03-15 19:04:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:35,280 INFO L470 AbstractCegarLoop]: Abstraction has 1104 states and 2998 transitions. [2022-03-15 19:04:35,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2998 transitions. [2022-03-15 19:04:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:35,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:35,281 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:35,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:35,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:35,499 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2128004161, now seen corresponding path program 103 times [2022-03-15 19:04:35,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:35,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788842206] [2022-03-15 19:04:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:35,679 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:35,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788842206] [2022-03-15 19:04:35,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788842206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:35,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036534922] [2022-03-15 19:04:35,679 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:04:35,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:35,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:35,680 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:35,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-03-15 19:04:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:35,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:35,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:36,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:38,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036534922] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:38,358 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:38,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:04:38,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801940621] [2022-03-15 19:04:38,358 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:38,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:38,401 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:04:38,401 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:43,308 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [273541#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 273542#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 0 ~c2~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 273462#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 273544#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 273545#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 273466#(not (<= (mod ~v_assert~0 256) 0)), 273538#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 273539#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 273540#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 273543#(and (or (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:04:43,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:04:43,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:04:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1166, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:04:43,309 INFO L87 Difference]: Start difference. First operand 1104 states and 2998 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:44,590 INFO L93 Difference]: Finished difference Result 1470 states and 3947 transitions. [2022-03-15 19:04:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:04:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:04:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:44,592 INFO L225 Difference]: With dead ends: 1470 [2022-03-15 19:04:44,592 INFO L226 Difference]: Without dead ends: 1424 [2022-03-15 19:04:44,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 113 SyntacticMatches, 33 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1859 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=645, Invalid=3387, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:04:44,593 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:44,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:04:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-03-15 19:04:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1136. [2022-03-15 19:04:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 2.718942731277533) internal successors, (3086), 1135 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 3086 transitions. [2022-03-15 19:04:44,605 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 3086 transitions. Word has length 32 [2022-03-15 19:04:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:44,605 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 3086 transitions. [2022-03-15 19:04:44,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 3086 transitions. [2022-03-15 19:04:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:44,606 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:44,606 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:44,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-03-15 19:04:44,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-03-15 19:04:44,807 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1828224063, now seen corresponding path program 104 times [2022-03-15 19:04:44,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:44,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878216086] [2022-03-15 19:04:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:45,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:45,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878216086] [2022-03-15 19:04:45,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878216086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:45,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532705232] [2022-03-15 19:04:45,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:04:45,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:45,031 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:45,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-03-15 19:04:45,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:04:45,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:45,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:45,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:45,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:48,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532705232] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:48,024 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:48,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:04:48,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626163689] [2022-03-15 19:04:48,025 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:48,027 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:48,066 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:04:48,067 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:51,798 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [277556#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 277558#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 277472#(not (<= (mod ~v_assert~0 256) 0)), 277557#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1))), 277561#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 277562#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 277559#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 277560#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:04:51,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:04:51,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:04:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:04:51,799 INFO L87 Difference]: Start difference. First operand 1136 states and 3086 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:52,608 INFO L93 Difference]: Finished difference Result 1358 states and 3658 transitions. [2022-03-15 19:04:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:04:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:04:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:52,610 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:04:52,610 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:04:52,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 110 SyntacticMatches, 37 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=536, Invalid=3004, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:04:52,611 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:52,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:04:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:04:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1136. [2022-03-15 19:04:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 2.718942731277533) internal successors, (3086), 1135 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 3086 transitions. [2022-03-15 19:04:52,622 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 3086 transitions. Word has length 32 [2022-03-15 19:04:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:52,623 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 3086 transitions. [2022-03-15 19:04:52,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 3086 transitions. [2022-03-15 19:04:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:52,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:52,624 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:52,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:52,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:52,841 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 430481537, now seen corresponding path program 105 times [2022-03-15 19:04:52,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:52,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116525399] [2022-03-15 19:04:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:53,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:53,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116525399] [2022-03-15 19:04:53,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116525399] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:53,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360245806] [2022-03-15 19:04:53,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:04:53,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:53,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:53,001 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:53,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-03-15 19:04:53,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:04:53,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:53,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:53,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:53,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:04:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:55,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360245806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:04:55,132 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:04:55,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:04:55,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903668667] [2022-03-15 19:04:55,132 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:04:55,135 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:04:55,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:04:55,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:04:57,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [281458#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 281457#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 281455#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 281371#(not (<= (mod ~v_assert~0 256) 0)), 281459#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 281456#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))))] [2022-03-15 19:04:57,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:04:57,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:04:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:04:57,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:04:57,423 INFO L87 Difference]: Start difference. First operand 1136 states and 3086 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:04:57,983 INFO L93 Difference]: Finished difference Result 1358 states and 3658 transitions. [2022-03-15 19:04:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:04:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2022-03-15 19:04:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:04:57,985 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:04:57,985 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:04:57,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 44 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=462, Invalid=2508, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:04:57,986 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:04:57,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:04:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:04:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1152. [2022-03-15 19:04:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 2.7193744569939184) internal successors, (3130), 1151 states have internal predecessors, (3130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3130 transitions. [2022-03-15 19:04:57,998 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3130 transitions. Word has length 32 [2022-03-15 19:04:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:04:57,998 INFO L470 AbstractCegarLoop]: Abstraction has 1152 states and 3130 transitions. [2022-03-15 19:04:57,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:04:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3130 transitions. [2022-03-15 19:04:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:04:57,999 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:04:57,999 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:04:58,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-03-15 19:04:58,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-03-15 19:04:58,216 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:04:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:04:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash -596168226, now seen corresponding path program 106 times [2022-03-15 19:04:58,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:04:58,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036710550] [2022-03-15 19:04:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:04:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:04:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:04:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:58,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:04:58,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036710550] [2022-03-15 19:04:58,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036710550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:04:58,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717994825] [2022-03-15 19:04:58,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:04:58,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:04:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:04:58,322 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:04:58,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-03-15 19:04:58,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:04:58,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:04:58,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:04:58,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:04:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:04:59,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:00,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717994825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:00,714 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:00,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:00,714 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280898778] [2022-03-15 19:05:00,714 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:00,717 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:00,756 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:05:00,756 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:03,548 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [285306#(not (<= (mod ~v_assert~0 256) 0)), 285302#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 285380#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0))), 285378#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 285379#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 285381#(and (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:05:03,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:05:03,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:05:03,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:05:03,549 INFO L87 Difference]: Start difference. First operand 1152 states and 3130 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:04,368 INFO L93 Difference]: Finished difference Result 1406 states and 3784 transitions. [2022-03-15 19:05:04,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:05:04,368 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:04,370 INFO L225 Difference]: With dead ends: 1406 [2022-03-15 19:05:04,370 INFO L226 Difference]: Without dead ends: 1336 [2022-03-15 19:05:04,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 89 SyntacticMatches, 61 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=553, Invalid=2753, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:05:04,370 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:04,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-03-15 19:05:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1136. [2022-03-15 19:05:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 2.718942731277533) internal successors, (3086), 1135 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 3086 transitions. [2022-03-15 19:05:04,381 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 3086 transitions. Word has length 32 [2022-03-15 19:05:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:04,382 INFO L470 AbstractCegarLoop]: Abstraction has 1136 states and 3086 transitions. [2022-03-15 19:05:04,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 3086 transitions. [2022-03-15 19:05:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:04,383 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:04,383 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:04,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:04,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-03-15 19:05:04,600 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:04,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2135080051, now seen corresponding path program 107 times [2022-03-15 19:05:04,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:04,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315797837] [2022-03-15 19:05:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:04,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:04,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315797837] [2022-03-15 19:05:04,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315797837] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:04,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276109056] [2022-03-15 19:05:04,743 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:05:04,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:04,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:04,744 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:04,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-03-15 19:05:04,954 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:05:04,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:04,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:04,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:05,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:07,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276109056] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:07,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:07,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:07,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [353244631] [2022-03-15 19:05:07,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:07,088 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:07,122 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 224 transitions. [2022-03-15 19:05:07,122 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:09,008 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [289325#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 289248#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 289252#(not (<= (mod ~v_assert~0 256) 0)), 289326#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0))), 289327#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 289324#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))))] [2022-03-15 19:05:09,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:05:09,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:09,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:05:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=923, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:05:09,008 INFO L87 Difference]: Start difference. First operand 1136 states and 3086 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:09,638 INFO L93 Difference]: Finished difference Result 1406 states and 3790 transitions. [2022-03-15 19:05:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:05:09,638 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:09,640 INFO L225 Difference]: With dead ends: 1406 [2022-03-15 19:05:09,640 INFO L226 Difference]: Without dead ends: 1360 [2022-03-15 19:05:09,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 101 SyntacticMatches, 25 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=2931, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:05:09,641 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:09,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:05:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-03-15 19:05:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1120. [2022-03-15 19:05:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 2.7184986595174263) internal successors, (3042), 1119 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 3042 transitions. [2022-03-15 19:05:09,652 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 3042 transitions. Word has length 32 [2022-03-15 19:05:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:09,652 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 3042 transitions. [2022-03-15 19:05:09,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3042 transitions. [2022-03-15 19:05:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:09,653 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:09,653 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:09,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-03-15 19:05:09,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-03-15 19:05:09,870 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1283608796, now seen corresponding path program 108 times [2022-03-15 19:05:09,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:09,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378345925] [2022-03-15 19:05:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:10,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:10,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378345925] [2022-03-15 19:05:10,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378345925] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:10,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368472666] [2022-03-15 19:05:10,000 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:05:10,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:10,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:10,002 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:10,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-03-15 19:05:10,244 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:05:10,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:10,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:10,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:10,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:12,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368472666] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:12,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:12,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:05:12,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1609349819] [2022-03-15 19:05:12,203 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:12,205 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:12,239 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 224 transitions. [2022-03-15 19:05:12,239 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:14,038 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [293159#(not (<= (mod ~v_assert~0 256) 0)), 293244#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c1~0))), 293245#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0))), 293243#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 19:05:14,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:05:14,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:14,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:05:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:05:14,039 INFO L87 Difference]: Start difference. First operand 1120 states and 3042 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:14,711 INFO L93 Difference]: Finished difference Result 1278 states and 3438 transitions. [2022-03-15 19:05:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:05:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:14,713 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:05:14,713 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:05:14,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 103 SyntacticMatches, 23 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:05:14,714 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 141 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:14,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 13 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:05:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1152. [2022-03-15 19:05:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 2.7193744569939184) internal successors, (3130), 1151 states have internal predecessors, (3130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3130 transitions. [2022-03-15 19:05:14,725 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3130 transitions. Word has length 32 [2022-03-15 19:05:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:14,726 INFO L470 AbstractCegarLoop]: Abstraction has 1152 states and 3130 transitions. [2022-03-15 19:05:14,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3130 transitions. [2022-03-15 19:05:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:14,727 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:14,727 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:14,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2022-03-15 19:05:14,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-03-15 19:05:14,943 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1684928639, now seen corresponding path program 109 times [2022-03-15 19:05:14,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:14,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508068425] [2022-03-15 19:05:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:15,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:15,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508068425] [2022-03-15 19:05:15,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508068425] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:15,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967947865] [2022-03-15 19:05:15,139 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:05:15,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:15,140 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:15,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-03-15 19:05:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:15,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:15,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:15,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:17,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967947865] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:17,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:17,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:17,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211803649] [2022-03-15 19:05:17,878 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:17,880 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:17,920 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:05:17,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:22,199 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [297010#(not (<= (mod ~v_assert~0 256) 0)), 297083#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 297087#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 297006#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 297088#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 297082#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 297085#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 297089#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 297084#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 297086#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:05:22,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:05:22,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:05:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1148, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:05:22,199 INFO L87 Difference]: Start difference. First operand 1152 states and 3130 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:23,221 INFO L93 Difference]: Finished difference Result 1438 states and 3859 transitions. [2022-03-15 19:05:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:05:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:05:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:23,223 INFO L225 Difference]: With dead ends: 1438 [2022-03-15 19:05:23,223 INFO L226 Difference]: Without dead ends: 1392 [2022-03-15 19:05:23,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 119 SyntacticMatches, 27 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=674, Invalid=3358, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:05:23,224 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:23,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:05:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-03-15 19:05:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1184. [2022-03-15 19:05:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 2.720202874049028) internal successors, (3218), 1183 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 3218 transitions. [2022-03-15 19:05:23,251 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 3218 transitions. Word has length 32 [2022-03-15 19:05:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:23,251 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 3218 transitions. [2022-03-15 19:05:23,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 3218 transitions. [2022-03-15 19:05:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:23,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:23,268 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:23,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2022-03-15 19:05:23,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:23,485 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1984708737, now seen corresponding path program 110 times [2022-03-15 19:05:23,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:23,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932960014] [2022-03-15 19:05:23,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:23,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:23,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932960014] [2022-03-15 19:05:23,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932960014] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:23,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657590436] [2022-03-15 19:05:23,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:05:23,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:23,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:23,649 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:23,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-03-15 19:05:23,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:05:23,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:23,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:23,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:24,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:25,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657590436] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:25,892 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:25,892 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:25,892 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [750839447] [2022-03-15 19:05:25,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:25,895 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:25,942 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:05:25,942 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:30,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [301167#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (< 0 (+ 2 ~c1~0)) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (< 2 ~c1~0) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 7 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (< 0 ~c1~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 301168#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (< 0 (+ 2 ~c1~0)) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (< 2 ~c1~0) (<= 7 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (< 0 ~c1~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 301164#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 301166#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (< 1 ~c1~0) (<= ~c1~0 0) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (< 0 (+ ~c1~0 1)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 301169#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c1~0 1) ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~c1~0))), 301080#(not (<= (mod ~v_assert~0 256) 0)), 301165#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (< 1 ~c1~0) (<= ~c1~0 0) (<= 6 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 0 (+ ~c1~0 1)) (<= ~c2~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 301170#(and (or (<= (+ ~c1~0 1) ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 ~c1~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:05:30,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:05:30,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:05:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:05:30,369 INFO L87 Difference]: Start difference. First operand 1184 states and 3218 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:31,179 INFO L93 Difference]: Finished difference Result 1358 states and 3639 transitions. [2022-03-15 19:05:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:05:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:05:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:31,182 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:05:31,182 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:05:31,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 115 SyntacticMatches, 32 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=437, Invalid=2533, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:05:31,182 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:31,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:05:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:05:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1168. [2022-03-15 19:05:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 2.7197943444730077) internal successors, (3174), 1167 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 3174 transitions. [2022-03-15 19:05:31,194 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 3174 transitions. Word has length 32 [2022-03-15 19:05:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:31,194 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 3174 transitions. [2022-03-15 19:05:31,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 3174 transitions. [2022-03-15 19:05:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:31,195 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:31,195 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:31,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-03-15 19:05:31,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:31,396 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -51552959, now seen corresponding path program 111 times [2022-03-15 19:05:31,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:31,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976568063] [2022-03-15 19:05:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:31,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:31,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976568063] [2022-03-15 19:05:31,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976568063] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:31,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501581003] [2022-03-15 19:05:31,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:05:31,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:31,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:31,558 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:31,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-03-15 19:05:31,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:05:31,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:31,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:31,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:32,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:34,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501581003] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:34,491 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:34,491 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:34,491 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978207280] [2022-03-15 19:05:34,491 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:34,493 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:34,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:05:34,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:37,701 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [305033#(not (<= (mod ~v_assert~0 256) 0)), 305121#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 305120#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 305117#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 305118#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 305119#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:05:37,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:05:37,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:05:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:05:37,701 INFO L87 Difference]: Start difference. First operand 1168 states and 3174 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:38,420 INFO L93 Difference]: Finished difference Result 1374 states and 3702 transitions. [2022-03-15 19:05:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:05:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:38,422 INFO L225 Difference]: With dead ends: 1374 [2022-03-15 19:05:38,422 INFO L226 Difference]: Without dead ends: 1328 [2022-03-15 19:05:38,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 115 SyntacticMatches, 26 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=2345, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:05:38,423 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 163 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:38,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 14 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:05:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-03-15 19:05:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1184. [2022-03-15 19:05:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 2.720202874049028) internal successors, (3218), 1183 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 3218 transitions. [2022-03-15 19:05:38,434 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 3218 transitions. Word has length 32 [2022-03-15 19:05:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:38,434 INFO L470 AbstractCegarLoop]: Abstraction has 1184 states and 3218 transitions. [2022-03-15 19:05:38,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 3218 transitions. [2022-03-15 19:05:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:38,435 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:38,435 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:38,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:38,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:38,652 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1078202722, now seen corresponding path program 112 times [2022-03-15 19:05:38,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:38,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997922830] [2022-03-15 19:05:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:38,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:38,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997922830] [2022-03-15 19:05:38,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997922830] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:38,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342233578] [2022-03-15 19:05:38,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:05:38,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:38,777 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:38,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-03-15 19:05:38,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:05:38,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:38,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:38,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:39,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:41,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342233578] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:41,739 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:41,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:41,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848420021] [2022-03-15 19:05:41,740 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:41,742 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:41,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:05:41,801 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:45,012 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [309116#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 309040#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 309117#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 309118#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 309044#(not (<= (mod ~v_assert~0 256) 0)), 309119#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:05:45,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:05:45,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:05:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:05:45,013 INFO L87 Difference]: Start difference. First operand 1184 states and 3218 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:45,534 INFO L93 Difference]: Finished difference Result 1398 states and 3768 transitions. [2022-03-15 19:05:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:05:45,534 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:45,536 INFO L225 Difference]: With dead ends: 1398 [2022-03-15 19:05:45,536 INFO L226 Difference]: Without dead ends: 1352 [2022-03-15 19:05:45,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 121 SyntacticMatches, 29 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=454, Invalid=2408, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:05:45,536 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 159 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:45,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 14 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:05:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2022-03-15 19:05:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1168. [2022-03-15 19:05:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 2.7197943444730077) internal successors, (3174), 1167 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 3174 transitions. [2022-03-15 19:05:45,548 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 3174 transitions. Word has length 32 [2022-03-15 19:05:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:45,548 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 3174 transitions. [2022-03-15 19:05:45,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 3174 transitions. [2022-03-15 19:05:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:45,549 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:45,549 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:45,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:45,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:45,771 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1561819893, now seen corresponding path program 113 times [2022-03-15 19:05:45,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:45,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755693408] [2022-03-15 19:05:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:45,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:45,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755693408] [2022-03-15 19:05:45,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755693408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:45,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485981355] [2022-03-15 19:05:45,950 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:05:45,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:45,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:45,951 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:45,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-03-15 19:05:46,165 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:05:46,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:46,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:46,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:46,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:48,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485981355] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:48,352 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:48,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:48,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331870343] [2022-03-15 19:05:48,352 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:48,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:48,389 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 246 transitions. [2022-03-15 19:05:48,389 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:51,411 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [313111#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 313113#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 313110#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 313038#(not (<= (mod ~v_assert~0 256) 0)), 313034#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 313112#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:05:51,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:05:51,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:51,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:05:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:05:51,412 INFO L87 Difference]: Start difference. First operand 1168 states and 3174 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:52,625 INFO L93 Difference]: Finished difference Result 1534 states and 4142 transitions. [2022-03-15 19:05:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:05:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:52,628 INFO L225 Difference]: With dead ends: 1534 [2022-03-15 19:05:52,628 INFO L226 Difference]: Without dead ends: 1488 [2022-03-15 19:05:52,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 100 SyntacticMatches, 34 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=674, Invalid=3108, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:05:52,628 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:52,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 8 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:05:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-03-15 19:05:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1200. [2022-03-15 19:05:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1199 states have (on average 2.720600500417014) internal successors, (3262), 1199 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3262 transitions. [2022-03-15 19:05:52,640 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3262 transitions. Word has length 32 [2022-03-15 19:05:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:52,640 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 3262 transitions. [2022-03-15 19:05:52,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3262 transitions. [2022-03-15 19:05:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:52,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:52,641 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:52,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2022-03-15 19:05:52,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:52,842 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1606044161, now seen corresponding path program 114 times [2022-03-15 19:05:52,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:52,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376554959] [2022-03-15 19:05:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:53,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:53,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376554959] [2022-03-15 19:05:53,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376554959] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:53,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337967713] [2022-03-15 19:05:53,006 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:05:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:53,007 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:53,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-03-15 19:05:53,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:05:53,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:05:53,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:53,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:53,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:05:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:55,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337967713] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:05:55,426 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:05:55,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:05:55,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948480196] [2022-03-15 19:05:55,426 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:55,429 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:55,461 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 246 transitions. [2022-03-15 19:05:55,461 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:57,165 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [317321#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 317320#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 317322#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 317236#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:05:57,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:05:57,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:05:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:05:57,168 INFO L87 Difference]: Start difference. First operand 1200 states and 3262 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:57,597 INFO L93 Difference]: Finished difference Result 1374 states and 3702 transitions. [2022-03-15 19:05:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:05:57,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 32 [2022-03-15 19:05:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:57,599 INFO L225 Difference]: With dead ends: 1374 [2022-03-15 19:05:57,599 INFO L226 Difference]: Without dead ends: 1328 [2022-03-15 19:05:57,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 115 SyntacticMatches, 20 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2022-03-15 19:05:57,600 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 92 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:57,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 11 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:05:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-03-15 19:05:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1232. [2022-03-15 19:05:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 2.7213647441104794) internal successors, (3350), 1231 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 3350 transitions. [2022-03-15 19:05:57,611 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 3350 transitions. Word has length 32 [2022-03-15 19:05:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:57,611 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 3350 transitions. [2022-03-15 19:05:57,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 3350 transitions. [2022-03-15 19:05:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:05:57,613 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:57,613 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:57,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-03-15 19:05:57,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-03-15 19:05:57,830 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:05:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash 579394398, now seen corresponding path program 115 times [2022-03-15 19:05:57,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:57,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711999034] [2022-03-15 19:05:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:57,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:57,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711999034] [2022-03-15 19:05:57,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711999034] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:05:57,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576275938] [2022-03-15 19:05:57,973 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:05:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:05:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:57,974 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:05:57,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-03-15 19:05:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:58,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:05:58,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:05:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:58,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:00,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576275938] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:00,647 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:00,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:00,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [419047311] [2022-03-15 19:06:00,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:00,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:00,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:06:00,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:02,754 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [321335#(not (<= (mod ~v_assert~0 256) 0)), 321410#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 321409#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 321408#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 321407#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 321331#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:06:02,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:06:02,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:02,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:06:02,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:06:02,755 INFO L87 Difference]: Start difference. First operand 1232 states and 3350 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:03,253 INFO L93 Difference]: Finished difference Result 1406 states and 3790 transitions. [2022-03-15 19:06:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:06:03,253 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:03,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:03,255 INFO L225 Difference]: With dead ends: 1406 [2022-03-15 19:06:03,255 INFO L226 Difference]: Without dead ends: 1360 [2022-03-15 19:06:03,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 96 SyntacticMatches, 54 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=2216, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:06:03,255 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 139 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:03,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 16 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-03-15 19:06:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1216. [2022-03-15 19:06:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 2.7209876543209877) internal successors, (3306), 1215 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3306 transitions. [2022-03-15 19:06:03,267 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3306 transitions. Word has length 32 [2022-03-15 19:06:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:03,267 INFO L470 AbstractCegarLoop]: Abstraction has 1216 states and 3306 transitions. [2022-03-15 19:06:03,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3306 transitions. [2022-03-15 19:06:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:03,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:03,268 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:03,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:03,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-03-15 19:06:03,484 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1185804791, now seen corresponding path program 116 times [2022-03-15 19:06:03,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:03,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042131004] [2022-03-15 19:06:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:03,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:03,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042131004] [2022-03-15 19:06:03,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042131004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:03,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631919151] [2022-03-15 19:06:03,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:03,579 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:03,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-03-15 19:06:03,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:03,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:03,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:03,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:04,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:05,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631919151] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:05,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:05,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:06:05,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [232309326] [2022-03-15 19:06:05,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:05,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:05,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:06:05,643 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:08,552 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [325505#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 0 ~c2~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 325418#(not (<= (mod ~v_assert~0 256) 0)), 325502#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 325503#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0))), 325504#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0))), 325506#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:06:08,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:06:08,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:06:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:06:08,553 INFO L87 Difference]: Start difference. First operand 1216 states and 3306 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:09,327 INFO L93 Difference]: Finished difference Result 1454 states and 3903 transitions. [2022-03-15 19:06:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:06:09,327 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:09,329 INFO L225 Difference]: With dead ends: 1454 [2022-03-15 19:06:09,329 INFO L226 Difference]: Without dead ends: 1408 [2022-03-15 19:06:09,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 102 SyntacticMatches, 38 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:06:09,330 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 151 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:09,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 12 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-03-15 19:06:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1216. [2022-03-15 19:06:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 2.7209876543209877) internal successors, (3306), 1215 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3306 transitions. [2022-03-15 19:06:09,342 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3306 transitions. Word has length 32 [2022-03-15 19:06:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:09,342 INFO L470 AbstractCegarLoop]: Abstraction has 1216 states and 3306 transitions. [2022-03-15 19:06:09,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3306 transitions. [2022-03-15 19:06:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:09,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:09,343 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:09,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:09,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-03-15 19:06:09,550 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1456867298, now seen corresponding path program 117 times [2022-03-15 19:06:09,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:09,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41778621] [2022-03-15 19:06:09,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:09,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:09,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41778621] [2022-03-15 19:06:09,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41778621] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:09,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399448315] [2022-03-15 19:06:09,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:09,683 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-03-15 19:06:09,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:06:09,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:09,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:09,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:10,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:12,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399448315] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:12,459 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:12,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:12,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1711330002] [2022-03-15 19:06:12,459 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:12,462 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:12,497 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:06:12,497 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:14,634 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [329649#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 329650#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 329565#(not (<= (mod ~v_assert~0 256) 0)), 329651#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 19:06:14,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:06:14,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:14,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:06:14,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:06:14,635 INFO L87 Difference]: Start difference. First operand 1216 states and 3306 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:15,185 INFO L93 Difference]: Finished difference Result 1390 states and 3746 transitions. [2022-03-15 19:06:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:06:15,185 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:15,187 INFO L225 Difference]: With dead ends: 1390 [2022-03-15 19:06:15,187 INFO L226 Difference]: Without dead ends: 1344 [2022-03-15 19:06:15,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 117 SyntacticMatches, 26 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=420, Invalid=2030, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:06:15,188 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 140 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:15,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 8 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-03-15 19:06:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1232. [2022-03-15 19:06:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 2.7213647441104794) internal successors, (3350), 1231 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 3350 transitions. [2022-03-15 19:06:15,199 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 3350 transitions. Word has length 32 [2022-03-15 19:06:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:15,200 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 3350 transitions. [2022-03-15 19:06:15,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 3350 transitions. [2022-03-15 19:06:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:15,201 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:15,201 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:15,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:15,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-03-15 19:06:15,403 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1511670137, now seen corresponding path program 118 times [2022-03-15 19:06:15,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:15,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299267004] [2022-03-15 19:06:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:15,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:15,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299267004] [2022-03-15 19:06:15,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299267004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:15,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405379312] [2022-03-15 19:06:15,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:06:15,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:15,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:15,586 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:15,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-03-15 19:06:15,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:06:15,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:15,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:15,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:16,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:18,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405379312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:18,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:18,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:18,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1593423739] [2022-03-15 19:06:18,431 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:18,434 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:18,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:06:18,489 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:20,756 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [333758#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0))), 333759#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 333680#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 333756#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 333757#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 333684#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:06:20,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:06:20,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:06:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:06:20,757 INFO L87 Difference]: Start difference. First operand 1232 states and 3350 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:21,250 INFO L93 Difference]: Finished difference Result 1374 states and 3683 transitions. [2022-03-15 19:06:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:06:21,250 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:21,252 INFO L225 Difference]: With dead ends: 1374 [2022-03-15 19:06:21,252 INFO L226 Difference]: Without dead ends: 1328 [2022-03-15 19:06:21,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 131 SyntacticMatches, 19 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:06:21,252 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 151 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:21,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 9 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-03-15 19:06:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1216. [2022-03-15 19:06:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 2.7209876543209877) internal successors, (3306), 1215 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3306 transitions. [2022-03-15 19:06:21,264 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3306 transitions. Word has length 32 [2022-03-15 19:06:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:21,264 INFO L470 AbstractCegarLoop]: Abstraction has 1216 states and 3306 transitions. [2022-03-15 19:06:21,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3306 transitions. [2022-03-15 19:06:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:21,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:21,266 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:21,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:21,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:21,485 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:21,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1811450235, now seen corresponding path program 119 times [2022-03-15 19:06:21,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:21,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522757711] [2022-03-15 19:06:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:22,010 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:22,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522757711] [2022-03-15 19:06:22,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522757711] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:22,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953316413] [2022-03-15 19:06:22,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:06:22,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:22,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:22,012 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:22,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-03-15 19:06:22,239 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:06:22,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:22,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:22,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:22,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:24,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953316413] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:24,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:24,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:24,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689023120] [2022-03-15 19:06:24,632 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:24,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:24,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:06:24,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:28,705 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [337818#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ ~c2~0 1) 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~c2~0) (not (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (not (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~c2~0) (<= (+ ~c2~0 1) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (not (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c2~0 1) 0))), 337746#(not (<= (mod ~v_assert~0 256) 0)), 337819#(and (or (<= 1 ~pos~0) (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~c2~0) (<= (+ ~c2~0 1) 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (not (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~c2~0) (not (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (not (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= (mod ~v_assert~0 256) 0)) (or (<= (+ ~c2~0 1) 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0))), 337742#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:06:28,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:06:28,705 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:06:28,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:06:28,705 INFO L87 Difference]: Start difference. First operand 1216 states and 3306 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:29,315 INFO L93 Difference]: Finished difference Result 1358 states and 3658 transitions. [2022-03-15 19:06:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:06:29,316 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:29,317 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:06:29,317 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:06:29,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 109 SyntacticMatches, 43 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=370, Invalid=1792, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:06:29,318 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 94 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:29,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 8 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:06:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1200. [2022-03-15 19:06:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1199 states have (on average 2.720600500417014) internal successors, (3262), 1199 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3262 transitions. [2022-03-15 19:06:29,329 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3262 transitions. Word has length 32 [2022-03-15 19:06:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:29,329 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 3262 transitions. [2022-03-15 19:06:29,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3262 transitions. [2022-03-15 19:06:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:29,330 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:29,330 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:29,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:29,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:29,531 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash -662291484, now seen corresponding path program 120 times [2022-03-15 19:06:29,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:29,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231232658] [2022-03-15 19:06:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:29,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:29,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231232658] [2022-03-15 19:06:29,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231232658] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:29,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169662528] [2022-03-15 19:06:29,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:29,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:29,672 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:29,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-03-15 19:06:29,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 19:06:29,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:29,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:29,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:30,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:31,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169662528] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:31,766 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:31,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:31,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518386012] [2022-03-15 19:06:31,766 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:31,769 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:31,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 202 transitions. [2022-03-15 19:06:31,799 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:32,806 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [341824#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 341740#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:06:32,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:06:32,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:32,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:06:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:06:32,807 INFO L87 Difference]: Start difference. First operand 1200 states and 3262 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:33,184 INFO L93 Difference]: Finished difference Result 1278 states and 3457 transitions. [2022-03-15 19:06:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:06:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:33,186 INFO L225 Difference]: With dead ends: 1278 [2022-03-15 19:06:33,186 INFO L226 Difference]: Without dead ends: 1232 [2022-03-15 19:06:33,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 97 SyntacticMatches, 24 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=488, Invalid=2062, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:06:33,187 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:33,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-03-15 19:06:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1200. [2022-03-15 19:06:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1199 states have (on average 2.720600500417014) internal successors, (3262), 1199 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3262 transitions. [2022-03-15 19:06:33,221 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3262 transitions. Word has length 32 [2022-03-15 19:06:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:33,221 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 3262 transitions. [2022-03-15 19:06:33,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3262 transitions. [2022-03-15 19:06:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:33,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:33,224 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:33,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:33,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-03-15 19:06:33,441 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:33,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1988721345, now seen corresponding path program 121 times [2022-03-15 19:06:33,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:33,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049296284] [2022-03-15 19:06:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:33,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:33,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049296284] [2022-03-15 19:06:33,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049296284] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:33,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747146202] [2022-03-15 19:06:33,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:06:33,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:33,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:33,588 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:33,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-03-15 19:06:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:33,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:33,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:34,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:36,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747146202] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:36,285 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:36,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:36,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030478883] [2022-03-15 19:06:36,285 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:36,287 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:36,326 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:06:36,326 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:42,507 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [345759#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 345761#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 345683#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 345763#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 345764#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 345687#(not (<= (mod ~v_assert~0 256) 0)), 345766#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 3) (<= ~c2~0 0) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= ~c2~0 0) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 345765#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (<= ~c2~0 0) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 345762#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 345760#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:06:42,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:06:42,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:06:42,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:06:42,508 INFO L87 Difference]: Start difference. First operand 1200 states and 3262 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:45,111 INFO L93 Difference]: Finished difference Result 1682 states and 4462 transitions. [2022-03-15 19:06:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 19:06:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:06:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:45,114 INFO L225 Difference]: With dead ends: 1682 [2022-03-15 19:06:45,114 INFO L226 Difference]: Without dead ends: 1612 [2022-03-15 19:06:45,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 115 SyntacticMatches, 31 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=934, Invalid=4468, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:06:45,115 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:45,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 0 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:06:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-03-15 19:06:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1264. [2022-03-15 19:06:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 2.728424386381631) internal successors, (3446), 1263 states have internal predecessors, (3446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 3446 transitions. [2022-03-15 19:06:45,130 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 3446 transitions. Word has length 32 [2022-03-15 19:06:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:45,130 INFO L470 AbstractCegarLoop]: Abstraction has 1264 states and 3446 transitions. [2022-03-15 19:06:45,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 3446 transitions. [2022-03-15 19:06:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:45,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:45,131 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:45,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2022-03-15 19:06:45,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-03-15 19:06:45,351 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 569764353, now seen corresponding path program 122 times [2022-03-15 19:06:45,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:45,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869532802] [2022-03-15 19:06:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:45,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:45,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869532802] [2022-03-15 19:06:45,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869532802] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:45,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312889592] [2022-03-15 19:06:45,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:45,476 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:45,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-03-15 19:06:45,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:45,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:45,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:45,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:46,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:47,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312889592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:47,962 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:47,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:47,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [71069320] [2022-03-15 19:06:47,962 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:47,965 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:48,023 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:06:48,023 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:52,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [350181#(not (<= (mod ~v_assert~0 256) 0)), 350268#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 2) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 350266#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 350269#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 2) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 350265#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 350267#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:06:52,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:06:52,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:06:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:06:52,388 INFO L87 Difference]: Start difference. First operand 1264 states and 3446 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:53,281 INFO L93 Difference]: Finished difference Result 1502 states and 4062 transitions. [2022-03-15 19:06:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:06:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2022-03-15 19:06:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:53,283 INFO L225 Difference]: With dead ends: 1502 [2022-03-15 19:06:53,283 INFO L226 Difference]: Without dead ends: 1456 [2022-03-15 19:06:53,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 102 SyntacticMatches, 39 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=456, Invalid=2514, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:06:53,284 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:53,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:06:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-03-15 19:06:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1296. [2022-03-15 19:06:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 2.7289575289575287) internal successors, (3534), 1295 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 3534 transitions. [2022-03-15 19:06:53,297 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 3534 transitions. Word has length 32 [2022-03-15 19:06:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:53,297 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 3534 transitions. [2022-03-15 19:06:53,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 3534 transitions. [2022-03-15 19:06:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:06:53,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:53,298 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:53,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:53,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:53,506 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:06:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -456885410, now seen corresponding path program 123 times [2022-03-15 19:06:53,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:53,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242573308] [2022-03-15 19:06:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:53,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:53,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242573308] [2022-03-15 19:06:53,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242573308] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:53,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102408040] [2022-03-15 19:06:53,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:53,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:53,718 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:53,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-03-15 19:06:53,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:06:53,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:53,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:06:53,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:54,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:56,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102408040] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:56,819 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:56,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:06:56,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1878251288] [2022-03-15 19:06:56,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:56,822 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:56,859 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:06:56,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:01,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [354623#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 2) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 354624#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 2) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 354536#(not (<= (mod ~v_assert~0 256) 0)), 354622#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 354620#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 354621#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c2~0 0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0)))] [2022-03-15 19:07:01,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:07:01,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:07:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:07:01,033 INFO L87 Difference]: Start difference. First operand 1296 states and 3534 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:01,853 INFO L93 Difference]: Finished difference Result 1550 states and 4188 transitions. [2022-03-15 19:07:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:07:01,853 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:01,855 INFO L225 Difference]: With dead ends: 1550 [2022-03-15 19:07:01,855 INFO L226 Difference]: Without dead ends: 1480 [2022-03-15 19:07:01,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 117 SyntacticMatches, 32 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=562, Invalid=2978, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 19:07:01,856 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:01,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:07:01,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2022-03-15 19:07:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1280. [2022-03-15 19:07:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72869429241595) internal successors, (3490), 1279 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3490 transitions. [2022-03-15 19:07:01,869 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3490 transitions. Word has length 32 [2022-03-15 19:07:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:01,869 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3490 transitions. [2022-03-15 19:07:01,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3490 transitions. [2022-03-15 19:07:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:01,870 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:01,871 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:01,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2022-03-15 19:07:02,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:02,083 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2111830091, now seen corresponding path program 124 times [2022-03-15 19:07:02,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:02,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458265310] [2022-03-15 19:07:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:02,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:02,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458265310] [2022-03-15 19:07:02,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458265310] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:02,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478509824] [2022-03-15 19:07:02,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:07:02,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:02,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:02,271 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:02,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-03-15 19:07:02,525 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:07:02,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:02,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:02,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:03,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:04,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478509824] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:04,510 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:04,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:07:04,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [597648865] [2022-03-15 19:07:04,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:04,544 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:04,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 246 transitions. [2022-03-15 19:07:04,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:07,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [358925#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 358929#(not (<= (mod ~v_assert~0 256) 0)), 359002#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 359001#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 359004#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 359003#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:07:07,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:07:07,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:07:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:07:07,021 INFO L87 Difference]: Start difference. First operand 1280 states and 3490 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:07,740 INFO L93 Difference]: Finished difference Result 1566 states and 4238 transitions. [2022-03-15 19:07:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:07:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:07,742 INFO L225 Difference]: With dead ends: 1566 [2022-03-15 19:07:07,742 INFO L226 Difference]: Without dead ends: 1520 [2022-03-15 19:07:07,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 107 SyntacticMatches, 27 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=603, Invalid=2819, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:07:07,743 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:07,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-03-15 19:07:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1280. [2022-03-15 19:07:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72869429241595) internal successors, (3490), 1279 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3490 transitions. [2022-03-15 19:07:07,780 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3490 transitions. Word has length 32 [2022-03-15 19:07:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:07,781 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3490 transitions. [2022-03-15 19:07:07,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3490 transitions. [2022-03-15 19:07:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:07,782 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:07,782 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:07,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2022-03-15 19:07:07,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:07,982 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2067605823, now seen corresponding path program 125 times [2022-03-15 19:07:07,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:07,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523466863] [2022-03-15 19:07:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:08,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:08,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523466863] [2022-03-15 19:07:08,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523466863] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:08,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34311652] [2022-03-15 19:07:08,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:07:08,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:08,124 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:08,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-03-15 19:07:08,359 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:07:08,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:08,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:08,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:08,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:10,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34311652] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:10,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:10,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:07:10,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631770742] [2022-03-15 19:07:10,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:10,514 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:10,548 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 246 transitions. [2022-03-15 19:07:10,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:12,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [363325#(not (<= (mod ~v_assert~0 256) 0)), 363397#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 363398#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 363321#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:07:12,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:07:12,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:12,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:07:12,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:07:12,636 INFO L87 Difference]: Start difference. First operand 1280 states and 3490 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:13,168 INFO L93 Difference]: Finished difference Result 1358 states and 3658 transitions. [2022-03-15 19:07:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:07:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:13,170 INFO L225 Difference]: With dead ends: 1358 [2022-03-15 19:07:13,170 INFO L226 Difference]: Without dead ends: 1312 [2022-03-15 19:07:13,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 33 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:07:13,171 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:13,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 3 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:07:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-03-15 19:07:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1280. [2022-03-15 19:07:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:13,183 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:13,183 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:13,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:13,184 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:13,184 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:13,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:13,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-03-15 19:07:13,395 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1200711710, now seen corresponding path program 126 times [2022-03-15 19:07:13,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:13,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12527992] [2022-03-15 19:07:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:13,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:13,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12527992] [2022-03-15 19:07:13,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12527992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:13,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10235728] [2022-03-15 19:07:13,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:07:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:13,604 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:13,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-03-15 19:07:13,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:07:13,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:13,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:13,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:14,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:16,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10235728] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:16,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:16,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:07:16,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1752459025] [2022-03-15 19:07:16,866 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:16,869 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:16,905 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:07:16,906 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:20,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [367483#(not (<= (mod ~v_assert~0 256) 0)), 367571#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 367568#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 367567#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 367569#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 367570#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)))] [2022-03-15 19:07:20,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:07:20,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:07:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:07:20,396 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:21,215 INFO L93 Difference]: Finished difference Result 1430 states and 3856 transitions. [2022-03-15 19:07:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:07:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:21,218 INFO L225 Difference]: With dead ends: 1430 [2022-03-15 19:07:21,218 INFO L226 Difference]: Without dead ends: 1384 [2022-03-15 19:07:21,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 103 SyntacticMatches, 46 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=460, Invalid=2510, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:07:21,218 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 157 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:21,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 16 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:07:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-03-15 19:07:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1280. [2022-03-15 19:07:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:21,230 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:21,230 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:21,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:21,231 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:21,231 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:21,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:21,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-03-15 19:07:21,443 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1807122103, now seen corresponding path program 127 times [2022-03-15 19:07:21,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:21,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959137510] [2022-03-15 19:07:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:21,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:21,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959137510] [2022-03-15 19:07:21,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959137510] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:21,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741048772] [2022-03-15 19:07:21,611 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:07:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:21,612 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:21,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-03-15 19:07:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:21,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:21,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:22,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:24,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741048772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:24,218 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:24,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:07:24,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373408133] [2022-03-15 19:07:24,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:24,221 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:24,256 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:07:24,256 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:27,128 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [371821#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 371822#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 371743#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 371747#(not (<= (mod ~v_assert~0 256) 0)), 371820#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0))), 371819#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0)))] [2022-03-15 19:07:27,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:07:27,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:07:27,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:07:27,129 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:27,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:27,644 INFO L93 Difference]: Finished difference Result 1518 states and 4079 transitions. [2022-03-15 19:07:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:07:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:27,646 INFO L225 Difference]: With dead ends: 1518 [2022-03-15 19:07:27,647 INFO L226 Difference]: Without dead ends: 1472 [2022-03-15 19:07:27,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 114 SyntacticMatches, 27 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=555, Invalid=2637, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:07:27,647 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:27,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 2 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-03-15 19:07:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1280. [2022-03-15 19:07:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:27,660 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:27,660 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:27,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:27,661 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:27,661 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:27,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:27,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-03-15 19:07:27,875 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash -835549986, now seen corresponding path program 128 times [2022-03-15 19:07:27,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:27,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341462772] [2022-03-15 19:07:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:28,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:28,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341462772] [2022-03-15 19:07:28,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341462772] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:28,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733661256] [2022-03-15 19:07:28,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:07:28,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:28,023 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:28,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-03-15 19:07:28,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:07:28,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:28,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:28,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:28,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:30,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733661256] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:30,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:30,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:07:30,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092537915] [2022-03-15 19:07:30,036 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:30,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:30,073 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:07:30,073 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:31,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [376077#(not (<= (mod ~v_assert~0 256) 0)), 376163#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= 2 ~c2~0) (= (mod ~v_assert~0 256) 0))), 376162#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 376161#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= 2 ~c2~0)))] [2022-03-15 19:07:31,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:07:31,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:31,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:07:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:07:31,810 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:32,265 INFO L93 Difference]: Finished difference Result 1422 states and 3834 transitions. [2022-03-15 19:07:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:07:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:32,267 INFO L225 Difference]: With dead ends: 1422 [2022-03-15 19:07:32,267 INFO L226 Difference]: Without dead ends: 1376 [2022-03-15 19:07:32,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 137 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=447, Invalid=2205, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:07:32,268 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:32,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 4 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-03-15 19:07:32,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1296. [2022-03-15 19:07:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 2.7227799227799228) internal successors, (3526), 1295 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 3526 transitions. [2022-03-15 19:07:32,280 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 3526 transitions. Word has length 32 [2022-03-15 19:07:32,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:32,281 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 3526 transitions. [2022-03-15 19:07:32,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 3526 transitions. [2022-03-15 19:07:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:32,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:32,282 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:32,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:32,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-03-15 19:07:32,487 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2132987449, now seen corresponding path program 129 times [2022-03-15 19:07:32,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:32,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283724470] [2022-03-15 19:07:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:32,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:32,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283724470] [2022-03-15 19:07:32,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283724470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:32,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097488584] [2022-03-15 19:07:32,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:07:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:32,644 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:32,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-03-15 19:07:32,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:07:32,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:32,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:32,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:33,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:34,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097488584] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:34,773 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:34,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:07:34,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221982766] [2022-03-15 19:07:34,773 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:34,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:34,814 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:07:34,814 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:37,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [380436#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 380433#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 380434#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 380349#(not (<= (mod ~v_assert~0 256) 0)), 380437#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 380435#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0)))] [2022-03-15 19:07:37,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:07:37,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:07:37,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:07:37,142 INFO L87 Difference]: Start difference. First operand 1296 states and 3526 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:37,615 INFO L93 Difference]: Finished difference Result 1502 states and 4035 transitions. [2022-03-15 19:07:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:07:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:37,617 INFO L225 Difference]: With dead ends: 1502 [2022-03-15 19:07:37,617 INFO L226 Difference]: Without dead ends: 1456 [2022-03-15 19:07:37,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 119 SyntacticMatches, 29 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=507, Invalid=2463, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:07:37,617 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 172 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:37,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 4 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-03-15 19:07:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1280. [2022-03-15 19:07:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:37,630 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:37,630 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:37,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:37,631 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:37,631 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:37,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:37,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:37,848 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1862199749, now seen corresponding path program 130 times [2022-03-15 19:07:37,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:37,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298558829] [2022-03-15 19:07:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:37,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:37,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298558829] [2022-03-15 19:07:37,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298558829] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:37,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543789772] [2022-03-15 19:07:37,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:07:37,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:37,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:37,966 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:37,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-03-15 19:07:38,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:07:38,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:38,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:38,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:38,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:40,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543789772] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:40,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:40,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:07:40,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462333827] [2022-03-15 19:07:40,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:40,388 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:40,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:07:40,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:42,434 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [384679#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 384755#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 384756#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= ~c2~0 2)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 384683#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:07:42,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:07:42,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:42,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:07:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:07:42,435 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:42,824 INFO L93 Difference]: Finished difference Result 1438 states and 3878 transitions. [2022-03-15 19:07:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:07:42,824 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:42,826 INFO L225 Difference]: With dead ends: 1438 [2022-03-15 19:07:42,826 INFO L226 Difference]: Without dead ends: 1392 [2022-03-15 19:07:42,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 109 SyntacticMatches, 42 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=419, Invalid=2031, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:07:42,827 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:42,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:07:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-03-15 19:07:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1280. [2022-03-15 19:07:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:42,839 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:42,839 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:42,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:42,841 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:42,841 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:42,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:43,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-03-15 19:07:43,055 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1325087607, now seen corresponding path program 131 times [2022-03-15 19:07:43,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:43,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19822997] [2022-03-15 19:07:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:43,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:43,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19822997] [2022-03-15 19:07:43,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19822997] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:43,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381996552] [2022-03-15 19:07:43,191 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:07:43,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:43,193 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:43,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-03-15 19:07:43,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:07:43,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:43,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:43,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:43,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:45,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381996552] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:45,351 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:45,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:07:45,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [144284221] [2022-03-15 19:07:45,351 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:45,354 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:45,391 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:07:45,391 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:48,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [388929#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 388933#(not (<= (mod ~v_assert~0 256) 0)), 389008#(and (or (<= ~c2~0 1) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0)) (or (<= ~c2~0 1) (<= 5 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 389006#(and (or (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0)) (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0))), 389005#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 0 ~c2~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0))), 389007#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (< 0 ~c2~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:07:48,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:07:48,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:07:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:07:48,247 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:48,937 INFO L93 Difference]: Finished difference Result 1470 states and 3966 transitions. [2022-03-15 19:07:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:07:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:48,939 INFO L225 Difference]: With dead ends: 1470 [2022-03-15 19:07:48,939 INFO L226 Difference]: Without dead ends: 1424 [2022-03-15 19:07:48,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 106 SyntacticMatches, 36 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=529, Invalid=2551, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:07:48,940 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:48,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:07:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2022-03-15 19:07:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1280. [2022-03-15 19:07:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:48,953 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:48,953 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:48,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:48,954 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:48,954 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:48,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:49,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:49,172 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1317584482, now seen corresponding path program 132 times [2022-03-15 19:07:49,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:49,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209388880] [2022-03-15 19:07:49,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:49,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:49,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209388880] [2022-03-15 19:07:49,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209388880] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:49,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018534825] [2022-03-15 19:07:49,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:07:49,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:49,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:49,285 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:49,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-03-15 19:07:49,601 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:07:49,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:49,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:49,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:50,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:52,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018534825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:52,381 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:52,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:07:52,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [400409655] [2022-03-15 19:07:52,381 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:52,384 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:52,420 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:07:52,420 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:54,353 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [393300#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 393215#(not (<= (mod ~v_assert~0 256) 0)), 393301#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 393299#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)))] [2022-03-15 19:07:54,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:07:54,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:07:54,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:07:54,354 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:54,898 INFO L93 Difference]: Finished difference Result 1414 states and 3812 transitions. [2022-03-15 19:07:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:07:54,898 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 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 32 [2022-03-15 19:07:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:54,900 INFO L225 Difference]: With dead ends: 1414 [2022-03-15 19:07:54,900 INFO L226 Difference]: Without dead ends: 1368 [2022-03-15 19:07:54,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=461, Invalid=2191, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:07:54,900 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 144 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:54,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 8 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:07:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-03-15 19:07:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1280. [2022-03-15 19:07:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:07:54,912 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:07:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:54,913 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:07:54,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:07:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:07:54,914 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:54,914 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:54,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:55,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:55,127 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:07:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1650952953, now seen corresponding path program 133 times [2022-03-15 19:07:55,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:55,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284606619] [2022-03-15 19:07:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:55,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:55,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284606619] [2022-03-15 19:07:55,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284606619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:55,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634909867] [2022-03-15 19:07:55,253 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:07:55,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:55,254 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:07:55,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-03-15 19:07:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:55,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:07:55,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:56,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:58,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634909867] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:58,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:58,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:07:58,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077110482] [2022-03-15 19:07:58,111 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:58,113 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:58,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:07:58,151 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:01,041 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [397455#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 397533#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 3 ~pos~0))), 397459#(not (<= (mod ~v_assert~0 256) 0)), 397534#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (<= 5 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 397532#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 397531#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0)))] [2022-03-15 19:08:01,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:08:01,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:08:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=961, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 19:08:01,042 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:01,698 INFO L93 Difference]: Finished difference Result 1502 states and 4035 transitions. [2022-03-15 19:08:01,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:08:01,698 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:01,700 INFO L225 Difference]: With dead ends: 1502 [2022-03-15 19:08:01,701 INFO L226 Difference]: Without dead ends: 1456 [2022-03-15 19:08:01,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 121 SyntacticMatches, 28 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=532, Invalid=2548, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:08:01,701 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:01,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 7 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:08:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-03-15 19:08:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1280. [2022-03-15 19:08:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:08:01,714 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:08:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:01,714 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:08:01,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:08:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:01,715 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:01,715 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:01,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2022-03-15 19:08:01,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:01,917 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:01,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1950733051, now seen corresponding path program 134 times [2022-03-15 19:08:01,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:01,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769432728] [2022-03-15 19:08:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:02,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:02,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769432728] [2022-03-15 19:08:02,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769432728] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:02,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39565232] [2022-03-15 19:08:02,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:08:02,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:02,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:02,035 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:02,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-03-15 19:08:02,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:08:02,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:02,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:02,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:02,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:04,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39565232] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:04,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:04,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:08:04,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321669628] [2022-03-15 19:08:04,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:04,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:04,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:08:04,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:06,923 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [401857#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 3 ~pos~0))), 401856#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 401858#(and (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= ~c2~0 1) (<= 5 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0))), 401772#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:08:06,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:08:06,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:08:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:08:06,924 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:07,325 INFO L93 Difference]: Finished difference Result 1438 states and 3878 transitions. [2022-03-15 19:08:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:08:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:07,327 INFO L225 Difference]: With dead ends: 1438 [2022-03-15 19:08:07,327 INFO L226 Difference]: Without dead ends: 1392 [2022-03-15 19:08:07,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 131 SyntacticMatches, 19 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=419, Invalid=2131, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:08:07,328 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 112 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:07,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 6 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-03-15 19:08:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1280. [2022-03-15 19:08:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.72243940578577) internal successors, (3482), 1279 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3482 transitions. [2022-03-15 19:08:07,340 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3482 transitions. Word has length 32 [2022-03-15 19:08:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:07,340 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3482 transitions. [2022-03-15 19:08:07,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3482 transitions. [2022-03-15 19:08:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:07,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:07,341 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:07,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:07,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:07,559 INFO L402 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash 340012638, now seen corresponding path program 135 times [2022-03-15 19:08:07,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:07,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788269374] [2022-03-15 19:08:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:07,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:07,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:07,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788269374] [2022-03-15 19:08:07,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788269374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:07,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589839607] [2022-03-15 19:08:07,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:08:07,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:07,696 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:07,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-03-15 19:08:07,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:08:07,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:07,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:07,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:08,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:09,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589839607] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:09,862 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:09,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:08:09,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333733177] [2022-03-15 19:08:09,874 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:09,877 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:09,911 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 246 transitions. [2022-03-15 19:08:09,911 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:11,293 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [406107#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256))), 406023#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:08:11,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:08:11,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:08:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:08:11,294 INFO L87 Difference]: Start difference. First operand 1280 states and 3482 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:11,663 INFO L93 Difference]: Finished difference Result 1382 states and 3743 transitions. [2022-03-15 19:08:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:08:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:11,665 INFO L225 Difference]: With dead ends: 1382 [2022-03-15 19:08:11,665 INFO L226 Difference]: Without dead ends: 1336 [2022-03-15 19:08:11,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 111 SyntacticMatches, 26 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=2077, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:08:11,666 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:11,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-03-15 19:08:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1288. [2022-03-15 19:08:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 2.722610722610723) internal successors, (3504), 1287 states have internal predecessors, (3504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3504 transitions. [2022-03-15 19:08:11,678 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 3504 transitions. Word has length 32 [2022-03-15 19:08:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:11,678 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 3504 transitions. [2022-03-15 19:08:11,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 3504 transitions. [2022-03-15 19:08:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:11,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:11,679 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:11,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:11,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable143 [2022-03-15 19:08:11,897 INFO L402 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -986417223, now seen corresponding path program 136 times [2022-03-15 19:08:11,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:11,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702336412] [2022-03-15 19:08:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:11,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:12,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:12,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702336412] [2022-03-15 19:08:12,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702336412] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:12,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725558527] [2022-03-15 19:08:12,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:08:12,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:12,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:12,009 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:12,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-03-15 19:08:12,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:08:12,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:12,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:12,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:12,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:14,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725558527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:14,243 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:14,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:08:14,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1144796802] [2022-03-15 19:08:14,243 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:14,245 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:14,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:08:14,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:17,099 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [410325#(and (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 410322#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 410324#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 410246#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 410323#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 410250#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:08:17,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:08:17,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:08:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:08:17,099 INFO L87 Difference]: Start difference. First operand 1288 states and 3504 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:17,812 INFO L93 Difference]: Finished difference Result 1486 states and 4010 transitions. [2022-03-15 19:08:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:08:17,813 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:17,815 INFO L225 Difference]: With dead ends: 1486 [2022-03-15 19:08:17,815 INFO L226 Difference]: Without dead ends: 1440 [2022-03-15 19:08:17,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 104 SyntacticMatches, 46 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=609, Invalid=2813, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:08:17,815 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:17,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2022-03-15 19:08:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1304. [2022-03-15 19:08:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 2.7229470452801228) internal successors, (3548), 1303 states have internal predecessors, (3548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 3548 transitions. [2022-03-15 19:08:17,827 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 3548 transitions. Word has length 32 [2022-03-15 19:08:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:17,828 INFO L470 AbstractCegarLoop]: Abstraction has 1304 states and 3548 transitions. [2022-03-15 19:08:17,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 17 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 3548 transitions. [2022-03-15 19:08:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:17,829 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:17,829 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:17,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Ended with exit code 0 [2022-03-15 19:08:18,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2022-03-15 19:08:18,042 INFO L402 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -686637125, now seen corresponding path program 137 times [2022-03-15 19:08:18,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:18,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596785355] [2022-03-15 19:08:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:18,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:18,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596785355] [2022-03-15 19:08:18,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596785355] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:18,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288718729] [2022-03-15 19:08:18,186 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:08:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:18,187 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:18,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-03-15 19:08:18,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:08:18,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:18,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:18,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:18,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:20,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288718729] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:20,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:20,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:08:20,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1278738982] [2022-03-15 19:08:20,769 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:20,771 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:20,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:08:20,809 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:22,877 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [414687#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 414614#(not (<= (mod ~v_assert~0 256) 0)), 414686#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 4 ~pos~0))), 414610#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:08:22,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:08:22,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:08:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:08:22,878 INFO L87 Difference]: Start difference. First operand 1304 states and 3548 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:23,286 INFO L93 Difference]: Finished difference Result 1438 states and 3878 transitions. [2022-03-15 19:08:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:08:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:23,288 INFO L225 Difference]: With dead ends: 1438 [2022-03-15 19:08:23,288 INFO L226 Difference]: Without dead ends: 1392 [2022-03-15 19:08:23,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 95 SyntacticMatches, 57 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=442, Invalid=2108, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:08:23,289 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:23,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-03-15 19:08:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1288. [2022-03-15 19:08:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 2.722610722610723) internal successors, (3504), 1287 states have internal predecessors, (3504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3504 transitions. [2022-03-15 19:08:23,301 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 3504 transitions. Word has length 32 [2022-03-15 19:08:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:23,301 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 3504 transitions. [2022-03-15 19:08:23,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 15 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 3504 transitions. [2022-03-15 19:08:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:23,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:23,303 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:23,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:23,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:23,519 INFO L402 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1572068475, now seen corresponding path program 138 times [2022-03-15 19:08:23,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:23,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991815408] [2022-03-15 19:08:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:23,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:23,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991815408] [2022-03-15 19:08:23,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991815408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:23,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534571450] [2022-03-15 19:08:23,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:08:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:23,672 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:23,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-03-15 19:08:23,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:08:23,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:23,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:23,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:24,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:26,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534571450] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:26,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:26,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:08:26,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969721365] [2022-03-15 19:08:26,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:26,168 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:26,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 268 transitions. [2022-03-15 19:08:26,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:28,181 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [418872#(not (<= (mod ~v_assert~0 256) 0)), 418956#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 19:08:28,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:08:28,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:08:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:08:28,182 INFO L87 Difference]: Start difference. First operand 1288 states and 3504 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:28,743 INFO L93 Difference]: Finished difference Result 1390 states and 3765 transitions. [2022-03-15 19:08:28,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:08:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-03-15 19:08:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:28,745 INFO L225 Difference]: With dead ends: 1390 [2022-03-15 19:08:28,745 INFO L226 Difference]: Without dead ends: 1344 [2022-03-15 19:08:28,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 139 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=2027, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:08:28,746 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:28,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:08:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-03-15 19:08:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1296. [2022-03-15 19:08:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 2.7227799227799228) internal successors, (3526), 1295 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 3526 transitions. [2022-03-15 19:08:28,758 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 3526 transitions. Word has length 32 [2022-03-15 19:08:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:28,758 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 3526 transitions. [2022-03-15 19:08:28,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 3526 transitions. [2022-03-15 19:08:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:28,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:28,760 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:28,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:28,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2022-03-15 19:08:28,960 INFO L402 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 545418712, now seen corresponding path program 139 times [2022-03-15 19:08:28,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:28,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508339302] [2022-03-15 19:08:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:29,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:29,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508339302] [2022-03-15 19:08:29,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508339302] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:29,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588936832] [2022-03-15 19:08:29,123 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:08:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:29,124 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:29,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2022-03-15 19:08:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:29,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:29,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:30,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:31,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588936832] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:31,785 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:31,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:08:31,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1722618048] [2022-03-15 19:08:31,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:31,788 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:31,825 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 290 transitions. [2022-03-15 19:08:31,825 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:34,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [423118#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 423122#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:08:34,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:08:34,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:08:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:08:34,423 INFO L87 Difference]: Start difference. First operand 1296 states and 3526 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:34,873 INFO L93 Difference]: Finished difference Result 1398 states and 3787 transitions. [2022-03-15 19:08:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:08:34,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:34,875 INFO L225 Difference]: With dead ends: 1398 [2022-03-15 19:08:34,875 INFO L226 Difference]: Without dead ends: 1352 [2022-03-15 19:08:34,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 117 SyntacticMatches, 36 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=2064, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:08:34,875 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:34,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2022-03-15 19:08:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1288. [2022-03-15 19:08:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 2.722610722610723) internal successors, (3504), 1287 states have internal predecessors, (3504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3504 transitions. [2022-03-15 19:08:34,887 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 3504 transitions. Word has length 32 [2022-03-15 19:08:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:34,887 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 3504 transitions. [2022-03-15 19:08:34,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 3504 transitions. [2022-03-15 19:08:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:08:34,889 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:34,889 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:34,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Ended with exit code 0 [2022-03-15 19:08:35,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2022-03-15 19:08:35,093 INFO L402 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash 321333851, now seen corresponding path program 6 times [2022-03-15 19:08:35,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:35,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521240472] [2022-03-15 19:08:35,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:35,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:35,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521240472] [2022-03-15 19:08:35,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521240472] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:35,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263451691] [2022-03-15 19:08:35,344 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:08:35,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:35,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:35,346 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:35,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2022-03-15 19:08:35,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-15 19:08:35,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:35,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:08:35,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:36,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:37,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263451691] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:37,213 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:37,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-03-15 19:08:37,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430978375] [2022-03-15 19:08:37,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:37,218 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:37,248 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 154 transitions. [2022-03-15 19:08:37,248 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:38,558 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [427340#(not (<= (mod ~v_assert~0 256) 0)), 427424#(not (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)))] [2022-03-15 19:08:38,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:08:38,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:08:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:08:38,559 INFO L87 Difference]: Start difference. First operand 1288 states and 3504 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:39,060 INFO L93 Difference]: Finished difference Result 1372 states and 3714 transitions. [2022-03-15 19:08:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:08:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 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 32 [2022-03-15 19:08:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:39,062 INFO L225 Difference]: With dead ends: 1372 [2022-03-15 19:08:39,062 INFO L226 Difference]: Without dead ends: 1320 [2022-03-15 19:08:39,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 73 SyntacticMatches, 30 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=483, Invalid=2273, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 19:08:39,063 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:39,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:08:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-03-15 19:08:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1288. [2022-03-15 19:08:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 2.722610722610723) internal successors, (3504), 1287 states have internal predecessors, (3504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 3504 transitions. [2022-03-15 19:08:39,075 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 3504 transitions. Word has length 32 [2022-03-15 19:08:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:39,075 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 3504 transitions. [2022-03-15 19:08:39,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 3504 transitions. [2022-03-15 19:08:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:08:39,076 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:39,076 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:39,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2022-03-15 19:08:39,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2022-03-15 19:08:39,291 INFO L402 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1914173275, now seen corresponding path program 140 times [2022-03-15 19:08:39,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:39,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144084356] [2022-03-15 19:08:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:39,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:39,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144084356] [2022-03-15 19:08:39,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144084356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:39,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093748214] [2022-03-15 19:08:39,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:08:39,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:39,513 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:39,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2022-03-15 19:08:39,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:08:39,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:39,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:08:39,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:40,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:42,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093748214] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:42,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:42,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-03-15 19:08:42,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1141449268] [2022-03-15 19:08:42,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:42,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:42,721 INFO L252 McrAutomatonBuilder]: Finished intersection with 182 states and 374 transitions. [2022-03-15 19:08:42,721 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:49,291 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [431650#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 431653#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (<= (+ ~c1~0 4) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 6)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 431649#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 431648#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 431651#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ 5 ~pos~0)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0))), 431655#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 (+ 7 ~pos~0))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 5) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ 5 ~pos~0)) (= (mod ~v_assert~0 256) 0) (<= (+ 5 ~c1~0) 0))), 431652#(and (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 3)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ 5 ~pos~0)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 431658#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= 0 (+ ~pos~0 4)) (<= (+ ~c1~0 4) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 6 ~pos~0) (<= ~c1~0 6) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= (+ 6 ~c1~0) 0) (<= 0 (+ ~pos~0 6)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 8)) (= (mod ~v_assert~0 256) 0))), 431654#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= 0 (+ ~pos~0 4)) (<= (+ ~c1~0 4) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 6)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 431647#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1))), 431566#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 431656#(and (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 5 ~pos~0) (<= ~c1~0 5) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 (+ 7 ~pos~0))) (or (<= 0 (+ 5 ~pos~0)) (= (mod ~v_assert~0 256) 0) (<= (+ 5 ~c1~0) 0))), 431570#(not (<= (mod ~v_assert~0 256) 0)), 431657#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 6 ~pos~0) (<= ~c1~0 6) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (<= (+ ~c1~0 4) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 8)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 6 ~c1~0) 0) (<= 0 (+ ~pos~0 6)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:08:49,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:08:49,291 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:49,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:08:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1504, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:08:49,292 INFO L87 Difference]: Start difference. First operand 1288 states and 3504 transitions. Second operand has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:52,080 INFO L93 Difference]: Finished difference Result 1792 states and 4632 transitions. [2022-03-15 19:08:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 19:08:52,081 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:08:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:52,083 INFO L225 Difference]: With dead ends: 1792 [2022-03-15 19:08:52,083 INFO L226 Difference]: Without dead ends: 1722 [2022-03-15 19:08:52,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 147 SyntacticMatches, 36 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3256 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1322, Invalid=5988, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:08:52,084 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 700 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:52,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 0 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:08:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-03-15 19:08:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1312. [2022-03-15 19:08:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 2.730739893211289) internal successors, (3580), 1311 states have internal predecessors, (3580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 3580 transitions. [2022-03-15 19:08:52,104 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 3580 transitions. Word has length 34 [2022-03-15 19:08:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:52,104 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 3580 transitions. [2022-03-15 19:08:52,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 3580 transitions. [2022-03-15 19:08:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:08:52,106 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:52,106 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:52,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Forceful destruction successful, exit code 0 [2022-03-15 19:08:52,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:52,322 INFO L402 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash -38415510, now seen corresponding path program 141 times [2022-03-15 19:08:52,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:52,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302406141] [2022-03-15 19:08:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:52,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:52,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302406141] [2022-03-15 19:08:52,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302406141] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:52,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472796961] [2022-03-15 19:08:52,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:08:52,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:52,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:52,476 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:52,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2022-03-15 19:08:52,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:08:52,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:08:52,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:08:52,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:08:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:53,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:08:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:55,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472796961] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:08:55,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:08:55,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-03-15 19:08:55,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368452261] [2022-03-15 19:08:55,623 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:08:55,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:08:55,672 INFO L252 McrAutomatonBuilder]: Finished intersection with 148 states and 288 transitions. [2022-03-15 19:08:55,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:08:58,810 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [436390#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 436395#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 436307#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 436389#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0))), 436391#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 436393#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 436396#(and (or (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 436392#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 436394#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 436311#(not (<= (mod ~v_assert~0 256) 0))] [2022-03-15 19:08:58,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:08:58,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:08:58,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:08:58,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1295, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:08:58,811 INFO L87 Difference]: Start difference. First operand 1312 states and 3580 transitions. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:08:59,496 INFO L93 Difference]: Finished difference Result 1606 states and 4358 transitions. [2022-03-15 19:08:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:08:59,496 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 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 34 [2022-03-15 19:08:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:08:59,498 INFO L225 Difference]: With dead ends: 1606 [2022-03-15 19:08:59,498 INFO L226 Difference]: Without dead ends: 1560 [2022-03-15 19:08:59,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=681, Invalid=3351, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:08:59,499 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 379 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:08:59,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 0 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:08:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-03-15 19:08:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1312. [2022-03-15 19:08:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 2.730739893211289) internal successors, (3580), 1311 states have internal predecessors, (3580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 3580 transitions. [2022-03-15 19:08:59,513 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 3580 transitions. Word has length 34 [2022-03-15 19:08:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:08:59,513 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 3580 transitions. [2022-03-15 19:08:59,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:08:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 3580 transitions. [2022-03-15 19:08:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:08:59,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:08:59,514 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:08:59,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2022-03-15 19:08:59,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:59,725 INFO L402 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:08:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:08:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1345458789, now seen corresponding path program 142 times [2022-03-15 19:08:59,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:08:59,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119349210] [2022-03-15 19:08:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:08:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:08:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:08:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:08:59,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:08:59,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119349210] [2022-03-15 19:08:59,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119349210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:08:59,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503913391] [2022-03-15 19:08:59,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:08:59,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:08:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:08:59,985 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:08:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-03-15 19:09:00,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:09:00,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:00,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:00,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:00,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:02,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503913391] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:02,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:02,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-03-15 19:09:02,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [116911366] [2022-03-15 19:09:02,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:02,116 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:02,160 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 284 transitions. [2022-03-15 19:09:02,161 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:04,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [440908#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 440909#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 440905#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 440910#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 440824#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 440828#(not (<= (mod ~v_assert~0 256) 0)), 440906#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 440907#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:09:04,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:09:04,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:09:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:09:04,685 INFO L87 Difference]: Start difference. First operand 1312 states and 3580 transitions. Second operand has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:05,270 INFO L93 Difference]: Finished difference Result 1590 states and 4306 transitions. [2022-03-15 19:09:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:09:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 0 states have call successors, (0), 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 34 [2022-03-15 19:09:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:05,272 INFO L225 Difference]: With dead ends: 1590 [2022-03-15 19:09:05,272 INFO L226 Difference]: Without dead ends: 1544 [2022-03-15 19:09:05,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 88 SyntacticMatches, 65 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=476, Invalid=2716, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:09:05,273 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:05,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:09:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2022-03-15 19:09:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1312. [2022-03-15 19:09:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 2.730739893211289) internal successors, (3580), 1311 states have internal predecessors, (3580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 3580 transitions. [2022-03-15 19:09:05,300 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 3580 transitions. Word has length 34 [2022-03-15 19:09:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:05,300 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 3580 transitions. [2022-03-15 19:09:05,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 3580 transitions. [2022-03-15 19:09:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:05,302 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:05,302 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:05,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:05,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:05,514 INFO L402 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1623078646, now seen corresponding path program 143 times [2022-03-15 19:09:05,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:05,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297781423] [2022-03-15 19:09:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:05,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:05,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297781423] [2022-03-15 19:09:05,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297781423] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:05,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158537386] [2022-03-15 19:09:05,682 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:09:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:05,684 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:05,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2022-03-15 19:09:05,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:09:05,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:05,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 22 conjunts are in the unsatisfiable core [2022-03-15 19:09:05,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:06,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:10,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158537386] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:10,053 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:10,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2022-03-15 19:09:10,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643110224] [2022-03-15 19:09:10,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:10,057 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:10,107 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 350 transitions. [2022-03-15 19:09:10,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:15,004 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [445403#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 445407#(and (or (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 445314#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 445401#(and (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 445399#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 445408#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 445404#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 445318#(not (<= (mod ~v_assert~0 256) 0)), 445398#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 445400#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 445405#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 445406#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 445402#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 445409#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:09:15,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:09:15,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:09:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:09:15,004 INFO L87 Difference]: Start difference. First operand 1312 states and 3580 transitions. Second operand has 27 states, 27 states have (on average 4.592592592592593) internal successors, (124), 26 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:16,435 INFO L93 Difference]: Finished difference Result 1752 states and 4720 transitions. [2022-03-15 19:09:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:09:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.592592592592593) internal successors, (124), 26 states have internal predecessors, (124), 0 states have call successors, (0), 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 34 [2022-03-15 19:09:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:16,438 INFO L225 Difference]: With dead ends: 1752 [2022-03-15 19:09:16,438 INFO L226 Difference]: Without dead ends: 1672 [2022-03-15 19:09:16,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 144 SyntacticMatches, 22 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2569 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=896, Invalid=4956, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:09:16,438 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 350 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:16,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 0 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:09:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-03-15 19:09:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1344. [2022-03-15 19:09:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 2.7252419955323903) internal successors, (3660), 1343 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 3660 transitions. [2022-03-15 19:09:16,452 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 3660 transitions. Word has length 34 [2022-03-15 19:09:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:16,453 INFO L470 AbstractCegarLoop]: Abstraction has 1344 states and 3660 transitions. [2022-03-15 19:09:16,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.592592592592593) internal successors, (124), 26 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 3660 transitions. [2022-03-15 19:09:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:16,454 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:16,454 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:16,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:16,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,149 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:16,656 INFO L402 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1140052715, now seen corresponding path program 144 times [2022-03-15 19:09:16,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:16,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149830925] [2022-03-15 19:09:16,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:17,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:17,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149830925] [2022-03-15 19:09:17,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149830925] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:17,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269125555] [2022-03-15 19:09:17,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:09:17,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:17,123 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:17,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2022-03-15 19:09:17,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:09:17,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:17,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:17,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:18,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:20,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269125555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:20,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:20,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-03-15 19:09:20,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503064918] [2022-03-15 19:09:20,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:20,930 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:20,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 350 transitions. [2022-03-15 19:09:20,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:25,568 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [450139#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 450058#(not (<= (mod ~v_assert~0 256) 0)), 450136#(and (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 0 (+ ~c1~0 1)) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0)) (or (<= ~c2~0 1) (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (< 1 ~c1~0) (<= ~c1~0 0) (<= 6 ~pos~0))), 450138#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 450141#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 450142#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 450143#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0))), 450137#(and (or (<= ~c2~0 1) (< 0 (+ ~c1~0 1)) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (< 1 ~c1~0) (<= ~c1~0 0) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 1) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 1) (<= 2 ~pos~0) (= (mod ~v_assert~0 256) 0))), 450140#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 450054#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0))] [2022-03-15 19:09:25,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:09:25,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:09:25,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:09:25,569 INFO L87 Difference]: Start difference. First operand 1344 states and 3660 transitions. Second operand has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:26,594 INFO L93 Difference]: Finished difference Result 1670 states and 4499 transitions. [2022-03-15 19:09:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:09:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:09:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:26,596 INFO L225 Difference]: With dead ends: 1670 [2022-03-15 19:09:26,596 INFO L226 Difference]: Without dead ends: 1624 [2022-03-15 19:09:26,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 118 SyntacticMatches, 57 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=625, Invalid=3407, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:09:26,597 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 309 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:26,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 0 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:09:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-03-15 19:09:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1328. [2022-03-15 19:09:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 2.724943481537302) internal successors, (3616), 1327 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3616 transitions. [2022-03-15 19:09:26,610 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3616 transitions. Word has length 34 [2022-03-15 19:09:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:26,610 INFO L470 AbstractCegarLoop]: Abstraction has 1328 states and 3616 transitions. [2022-03-15 19:09:26,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3616 transitions. [2022-03-15 19:09:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:26,612 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:26,612 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:26,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:26,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,150 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:26,826 INFO L402 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 517544405, now seen corresponding path program 145 times [2022-03-15 19:09:26,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:26,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843553395] [2022-03-15 19:09:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:27,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:27,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843553395] [2022-03-15 19:09:27,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843553395] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:27,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010404278] [2022-03-15 19:09:27,085 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:09:27,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:27,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:27,086 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:27,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2022-03-15 19:09:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:27,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:27,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:28,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:30,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010404278] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:30,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:30,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-03-15 19:09:30,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538975575] [2022-03-15 19:09:30,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:30,570 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:30,621 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 350 transitions. [2022-03-15 19:09:30,621 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:34,047 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [454752#(and (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 454753#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 454666#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 454748#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0))), 454670#(not (<= (mod ~v_assert~0 256) 0)), 454747#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 454749#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 454750#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0))), 454751#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 454754#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:09:34,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:09:34,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:34,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:09:34,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:09:34,048 INFO L87 Difference]: Start difference. First operand 1328 states and 3616 transitions. Second operand has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:34,851 INFO L93 Difference]: Finished difference Result 1654 states and 4455 transitions. [2022-03-15 19:09:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:09:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:09:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:34,853 INFO L225 Difference]: With dead ends: 1654 [2022-03-15 19:09:34,853 INFO L226 Difference]: Without dead ends: 1608 [2022-03-15 19:09:34,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 115 SyntacticMatches, 61 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2421 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=3152, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:09:34,854 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:34,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:09:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-03-15 19:09:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1312. [2022-03-15 19:09:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 2.7246376811594204) internal successors, (3572), 1311 states have internal predecessors, (3572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 3572 transitions. [2022-03-15 19:09:34,867 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 3572 transitions. Word has length 34 [2022-03-15 19:09:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:34,867 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 3572 transitions. [2022-03-15 19:09:34,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 3572 transitions. [2022-03-15 19:09:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:34,868 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:34,869 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:34,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Ended with exit code 0 [2022-03-15 19:09:35,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,151 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:35,086 INFO L402 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1123954798, now seen corresponding path program 146 times [2022-03-15 19:09:35,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:35,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677365732] [2022-03-15 19:09:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:35,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:35,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677365732] [2022-03-15 19:09:35,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677365732] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:35,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880128078] [2022-03-15 19:09:35,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:09:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:35,305 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:35,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2022-03-15 19:09:35,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:09:35,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:35,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:35,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:36,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:38,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880128078] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:38,206 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:38,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-03-15 19:09:38,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983832171] [2022-03-15 19:09:38,206 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:38,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:38,257 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 328 transitions. [2022-03-15 19:09:38,257 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:41,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [459227#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 459310#(and (or (<= 1 ~pos~0) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0))), 459309#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (<= ~c1~0 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c2~0 0))), 459315#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0))), 459316#(and (or (<= 0 (+ ~pos~0 4)) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (<= (+ 3 ~c1~0) 0) (= (mod ~v_assert~0 256) 0)) (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 459311#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 1))), 459313#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0))), 459314#(and (or (<= (+ 2 ~c1~0) 0) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 3)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 1 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 459231#(not (<= (mod ~v_assert~0 256) 0)), 459312#(and (or (<= 2 ~pos~0) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0) (<= (+ ~c1~0 1) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:09:41,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:09:41,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:41,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:09:41,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:09:41,444 INFO L87 Difference]: Start difference. First operand 1312 states and 3572 transitions. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:42,353 INFO L93 Difference]: Finished difference Result 1678 states and 4540 transitions. [2022-03-15 19:09:42,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:09:42,354 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 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 34 [2022-03-15 19:09:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:42,356 INFO L225 Difference]: With dead ends: 1678 [2022-03-15 19:09:42,356 INFO L226 Difference]: Without dead ends: 1632 [2022-03-15 19:09:42,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 116 SyntacticMatches, 51 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=726, Invalid=3564, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:09:42,357 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 392 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:42,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 0 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:09:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2022-03-15 19:09:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1312. [2022-03-15 19:09:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 2.7246376811594204) internal successors, (3572), 1311 states have internal predecessors, (3572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 3572 transitions. [2022-03-15 19:09:42,369 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 3572 transitions. Word has length 34 [2022-03-15 19:09:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:42,369 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 3572 transitions. [2022-03-15 19:09:42,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 3572 transitions. [2022-03-15 19:09:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:42,371 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:42,371 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:42,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:42,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2022-03-15 19:09:42,583 INFO L402 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:42,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1518717291, now seen corresponding path program 147 times [2022-03-15 19:09:42,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:42,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134781734] [2022-03-15 19:09:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:43,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:43,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134781734] [2022-03-15 19:09:43,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134781734] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:43,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029976807] [2022-03-15 19:09:43,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:09:43,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:43,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:43,998 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:43,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2022-03-15 19:09:44,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-15 19:09:44,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:44,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:44,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:45,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:47,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029976807] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:47,676 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:47,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-03-15 19:09:47,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1865990475] [2022-03-15 19:09:47,677 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:47,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:47,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 328 transitions. [2022-03-15 19:09:47,729 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:50,905 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [463900#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (<= 4 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 ~pos~0))), 463819#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 463823#(not (<= (mod ~v_assert~0 256) 0)), 463904#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0))), 463901#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 463903#(and (or (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 463905#(and (or (<= 2 ~pos~0) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 2) (= (mod ~v_assert~0 256) 0) (<= 4 ~pos~0)) (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 4) (<= 6 ~pos~0) (= (mod ~v_assert~0 256) 0))), 463902#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0) (<= 3 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 5 ~pos~0) (<= ~c1~0 3) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)))] [2022-03-15 19:09:50,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:09:50,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:09:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:09:50,906 INFO L87 Difference]: Start difference. First operand 1312 states and 3572 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:51,810 INFO L93 Difference]: Finished difference Result 1646 states and 4452 transitions. [2022-03-15 19:09:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:09:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-03-15 19:09:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:51,813 INFO L225 Difference]: With dead ends: 1646 [2022-03-15 19:09:51,813 INFO L226 Difference]: Without dead ends: 1600 [2022-03-15 19:09:51,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 133 SyntacticMatches, 37 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=558, Invalid=2864, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:09:51,813 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:51,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:09:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-03-15 19:09:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1264. [2022-03-15 19:09:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 2.723673792557403) internal successors, (3440), 1263 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 3440 transitions. [2022-03-15 19:09:51,826 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 3440 transitions. Word has length 34 [2022-03-15 19:09:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:51,826 INFO L470 AbstractCegarLoop]: Abstraction has 1264 states and 3440 transitions. [2022-03-15 19:09:51,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 3440 transitions. [2022-03-15 19:09:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:51,828 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:51,828 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:51,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:52,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 153 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2022-03-15 19:09:52,045 INFO L402 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1915778469, now seen corresponding path program 148 times [2022-03-15 19:09:52,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:52,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658706151] [2022-03-15 19:09:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:52,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:52,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658706151] [2022-03-15 19:09:52,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658706151] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:52,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107568341] [2022-03-15 19:09:52,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:09:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:52,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:52,191 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:52,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2022-03-15 19:09:52,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:09:52,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:52,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:52,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:53,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:09:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:54,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107568341] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:09:54,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:09:54,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2022-03-15 19:09:54,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051344007] [2022-03-15 19:09:54,794 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:09:54,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:09:54,841 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 254 transitions. [2022-03-15 19:09:54,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:09:56,637 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [468277#(not (<= (mod ~v_assert~0 256) 0)), 468358#(and (or (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0))), 468356#(and (or (<= 0 (+ ~pos~0 1)) (= (mod ~v_assert~0 256) 0)) (or (<= ~c1~0 1) (= (mod ~v_assert~0 256) 0)) (or (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (<= 1 ~pos~0) (= (mod ~v_assert~0 256) 0) (<= (+ ~c1~0 1) 0))), 468357#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= (+ 2 ~c1~0) 0) (= (mod ~v_assert~0 256) 0) (<= 0 ~pos~0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 2)) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0) (= (mod ~v_assert~0 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 0) (= (mod ~v_assert~0 256) 0))), 468273#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), 468355#(and (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c1~0 1)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 0 (+ ~pos~0 1))) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= ~c2~0 0)) (or (= 0 (mod |thread1Thread1of1ForFork0_~cond~0#1| 256)) (<= 1 ~pos~0) (<= (+ ~c1~0 1) 0)))] [2022-03-15 19:09:56,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:09:56,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:09:56,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:09:56,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:09:56,638 INFO L87 Difference]: Start difference. First operand 1264 states and 3440 transitions. Second operand has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:09:57,149 INFO L93 Difference]: Finished difference Result 1510 states and 4078 transitions. [2022-03-15 19:09:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:09:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 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 34 [2022-03-15 19:09:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:09:57,152 INFO L225 Difference]: With dead ends: 1510 [2022-03-15 19:09:57,152 INFO L226 Difference]: Without dead ends: 1464 [2022-03-15 19:09:57,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 110 SyntacticMatches, 32 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=2506, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:09:57,152 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:09:57,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:09:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-03-15 19:09:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1280. [2022-03-15 19:09:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 2.724003127443315) internal successors, (3484), 1279 states have internal predecessors, (3484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 3484 transitions. [2022-03-15 19:09:57,169 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 3484 transitions. Word has length 34 [2022-03-15 19:09:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:09:57,170 INFO L470 AbstractCegarLoop]: Abstraction has 1280 states and 3484 transitions. [2022-03-15 19:09:57,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:09:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 3484 transitions. [2022-03-15 19:09:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:09:57,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:09:57,171 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:09:57,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Forceful destruction successful, exit code 0 [2022-03-15 19:09:57,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 154 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2022-03-15 19:09:57,391 INFO L402 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:09:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:09:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -683722632, now seen corresponding path program 149 times [2022-03-15 19:09:57,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:09:57,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036863806] [2022-03-15 19:09:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:09:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:09:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:09:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:57,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:09:57,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036863806] [2022-03-15 19:09:57,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036863806] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:09:57,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822245513] [2022-03-15 19:09:57,601 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:09:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:09:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:09:57,602 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:09:57,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2022-03-15 19:09:57,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:09:57,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:09:57,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:09:57,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:09:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:09:58,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:10:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:10:00,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822245513] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:10:00,456 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:10:00,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2022-03-15 19:10:00,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207325464] [2022-03-15 19:10:00,456 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:10:00,459 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:10:00,507 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 320 transitions. [2022-03-15 19:10:00,507 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2022-03-15 19:10:03,026 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:10:03,027 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:10:03,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Ended with exit code 0 [2022-03-15 19:10:03,056 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-03-15 19:10:03,068 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:10:03,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158,155 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:10:03,239 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. [2022-03-15 19:10:03,241 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:10:03,241 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:10:03,241 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:10:03,242 INFO L732 BasicCegarLoop]: Path program histogram: [149, 6, 2, 2] [2022-03-15 19:10:03,259 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:10:03,259 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:10:03,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:10:03 BasicIcfg [2022-03-15 19:10:03,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:10:03,262 INFO L158 Benchmark]: Toolchain (without parser) took 846013.28ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 969.9MB). Free memory was 123.2MB in the beginning and 815.4MB in the end (delta: -692.2MB). Peak memory consumption was 278.5MB. Max. memory is 8.0GB. [2022-03-15 19:10:03,262 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:10:03,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.13ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 122.9MB in the beginning and 191.8MB in the end (delta: -68.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-03-15 19:10:03,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.98ms. Allocated memory is still 221.2MB. Free memory was 191.8MB in the beginning and 189.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:10:03,262 INFO L158 Benchmark]: Boogie Preprocessor took 15.42ms. Allocated memory is still 221.2MB. Free memory was 189.9MB in the beginning and 188.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:10:03,262 INFO L158 Benchmark]: RCFGBuilder took 406.29ms. Allocated memory is still 221.2MB. Free memory was 188.8MB in the beginning and 171.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-15 19:10:03,262 INFO L158 Benchmark]: TraceAbstraction took 845303.14ms. Allocated memory was 221.2MB in the beginning and 1.2GB in the end (delta: 929.0MB). Free memory was 171.0MB in the beginning and 815.4MB in the end (delta: -644.4MB). Peak memory consumption was 285.7MB. Max. memory is 8.0GB. [2022-03-15 19:10:03,263 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.13ms. Allocated memory was 180.4MB in the beginning and 221.2MB in the end (delta: 40.9MB). Free memory was 122.9MB in the beginning and 191.8MB in the end (delta: -68.9MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.98ms. Allocated memory is still 221.2MB. Free memory was 191.8MB in the beginning and 189.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.42ms. Allocated memory is still 221.2MB. Free memory was 189.9MB in the beginning and 188.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 406.29ms. Allocated memory is still 221.2MB. Free memory was 188.8MB in the beginning and 171.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 845303.14ms. Allocated memory was 221.2MB in the beginning and 1.2GB in the end (delta: 929.0MB). Free memory was 171.0MB in the beginning and 815.4MB in the end (delta: -644.4MB). Peak memory consumption was 285.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 112 PlacesBefore, 34 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 1250 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 94 TotalNumberOfCompositions, 2093 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1774, positive: 1730, positive conditional: 0, positive unconditional: 1730, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 687, positive: 670, positive conditional: 0, positive unconditional: 670, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1774, positive: 1060, positive conditional: 0, positive unconditional: 1060, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 687, unknown conditional: 0, unknown unconditional: 687] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 6,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 845.2s, OverallIterations: 159, TraceHistogramMax: 7, PathProgramHistogramMax: 149, EmptinessCheckTime: 0.2s, AutomataDifference: 98.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28610 SdHoareTripleChecker+Valid, 43.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28610 mSDsluCounter, 520 SdHoareTripleChecker+Invalid, 36.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48889 mSDsCounter, 11295 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101857 IncrementalHoareTripleChecker+Invalid, 113152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11295 mSolverCounterUnsat, 65 mSDtfsCounter, 101857 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28277 GetRequests, 16612 SyntacticMatches, 3998 SemanticMatches, 7667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188053 ImplicationChecksByTransitivity, 161.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1344occurred in iteration=153, InterpolantAutomatonStates: 3766, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 158 MinimizatonAttempts, 23008 StatesRemovedByMinimization, 155 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 7.8s SatisfiabilityAnalysisTime, 313.7s InterpolantComputationTime, 9428 NumberOfCodeBlocks, 9428 NumberOfCodeBlocksAsserted, 727 NumberOfCheckSat, 13630 ConstructedInterpolants, 0 QuantifiedInterpolants, 403697 SizeOfPredicates, 7564 NumberOfNonLiveVariables, 25818 ConjunctsInSsa, 2494 ConjunctsInUnsatCore, 464 InterpolantComputations, 5 PerfectInterpolantSequences, 1968/10593 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown