/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithoutDepranks-Lazy.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-10 10:06:21,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 10:06:21,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 10:06:21,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 10:06:21,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 10:06:21,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 10:06:21,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 10:06:21,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 10:06:21,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 10:06:21,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 10:06:21,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 10:06:21,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 10:06:21,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 10:06:21,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 10:06:21,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 10:06:21,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 10:06:21,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 10:06:21,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 10:06:21,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 10:06:21,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 10:06:21,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 10:06:21,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 10:06:21,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 10:06:21,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 10:06:21,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 10:06:21,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 10:06:21,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 10:06:21,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 10:06:21,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 10:06:21,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 10:06:21,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 10:06:21,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 10:06:21,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 10:06:21,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 10:06:21,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 10:06:21,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 10:06:21,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 10:06:21,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 10:06:21,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 10:06:21,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 10:06:21,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 10:06:21,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithoutDepranks-Lazy.epf [2022-02-10 10:06:21,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 10:06:21,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 10:06:21,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 10:06:21,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 10:06:21,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 10:06:21,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 10:06:21,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 10:06:21,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 10:06:21,303 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 10:06:21,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 10:06:21,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 10:06:21,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 10:06:21,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 10:06:21,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 10:06:21,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 10:06:21,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 10:06:21,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 10:06:21,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 10:06:21,305 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITHOUT_DEPRANKS [2022-02-10 10:06:21,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-10 10:06:21,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 10:06:21,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 10:06:21,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 10:06:21,525 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 10:06:21,526 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 10:06:21,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-5.i [2022-02-10 10:06:21,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a540bf7/313b4e6eb0be488ab27bcf1eda1a051c/FLAG0cb244099 [2022-02-10 10:06:22,016 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 10:06:22,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i [2022-02-10 10:06:22,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a540bf7/313b4e6eb0be488ab27bcf1eda1a051c/FLAG0cb244099 [2022-02-10 10:06:22,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a540bf7/313b4e6eb0be488ab27bcf1eda1a051c [2022-02-10 10:06:22,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 10:06:22,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 10:06:22,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 10:06:22,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 10:06:22,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 10:06:22,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57670f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22, skipping insertion in model container [2022-02-10 10:06:22,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 10:06:22,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 10:06:22,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i[30813,30826] [2022-02-10 10:06:22,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 10:06:22,731 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 10:06:22,775 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i[30813,30826] [2022-02-10 10:06:22,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 10:06:22,801 INFO L208 MainTranslator]: Completed translation [2022-02-10 10:06:22,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22 WrapperNode [2022-02-10 10:06:22,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 10:06:22,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 10:06:22,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 10:06:22,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 10:06:22,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,851 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-02-10 10:06:22,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 10:06:22,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 10:06:22,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 10:06:22,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 10:06:22,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 10:06:22,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 10:06:22,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 10:06:22,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 10:06:22,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (1/1) ... [2022-02-10 10:06:22,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 10:06:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:06:22,929 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-02-10 10:06:22,948 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-02-10 10:06:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-10 10:06:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-10 10:06:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-10 10:06:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-10 10:06:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 10:06:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 10:06:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 10:06:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 10:06:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 10:06:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 10:06:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 10:06:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 10:06:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 10:06:23,009 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 10:06:23,112 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 10:06:23,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 10:06:23,229 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 10:06:23,233 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 10:06:23,234 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-10 10:06:23,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 10:06:23 BoogieIcfgContainer [2022-02-10 10:06:23,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 10:06:23,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 10:06:23,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 10:06:23,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 10:06:23,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 10:06:22" (1/3) ... [2022-02-10 10:06:23,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da044a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 10:06:23, skipping insertion in model container [2022-02-10 10:06:23,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 10:06:22" (2/3) ... [2022-02-10 10:06:23,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da044a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 10:06:23, skipping insertion in model container [2022-02-10 10:06:23,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 10:06:23" (3/3) ... [2022-02-10 10:06:23,247 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_safe-5.i [2022-02-10 10:06:23,250 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 10:06:23,250 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 10:06:23,250 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-10 10:06:23,250 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 10:06:23,281 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,282 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,282 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,282 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,283 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,289 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,291 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,294 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,295 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,297 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,297 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,297 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,297 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,297 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 10:06:23,298 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 10:06:23,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-10 10:06:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:06:23,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-10 10:06:23,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-10 10:06:23,365 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 10:06:23,369 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 10:06:23,369 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-10 10:06:23,551 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-10 10:06:23,553 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:06:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:06:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-02-10 10:06:23,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:06:23,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651131023] [2022-02-10 10:06:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:23,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:06:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:23,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:06:23,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651131023] [2022-02-10 10:06:23,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651131023] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 10:06:23,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 10:06:23,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 10:06:23,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038087245] [2022-02-10 10:06:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 10:06:23,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-10 10:06:23,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:06:23,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-10 10:06:23,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-10 10:06:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:23,813 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:06:23,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 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-02-10 10:06:23,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:23,874 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-10 10:06:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:23,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 10:06:23,875 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:06:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:06:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-02-10 10:06:23,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:06:23,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504600006] [2022-02-10 10:06:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:23,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:06:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:23,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:06:23,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504600006] [2022-02-10 10:06:23,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504600006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 10:06:23,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 10:06:23,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 10:06:23,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521411271] [2022-02-10 10:06:23,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 10:06:23,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 10:06:23,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:06:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 10:06:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 10:06:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:23,988 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:06:23,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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-02-10 10:06:23,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:23,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:24,132 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-02-10 10:06:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:24,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 10:06:24,133 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:06:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:06:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-02-10 10:06:24,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:06:24,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129488706] [2022-02-10 10:06:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:24,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:06:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:24,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:06:24,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129488706] [2022-02-10 10:06:24,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129488706] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 10:06:24,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199013407] [2022-02-10 10:06:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:24,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:06:24,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:06:24,249 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-02-10 10:06:24,250 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-02-10 10:06:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:24,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-10 10:06:24,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 10:06:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:24,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 10:06:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:24,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199013407] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 10:06:24,719 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 10:06:24,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-10 10:06:24,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765950539] [2022-02-10 10:06:24,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 10:06:24,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 10:06:24,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:06:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 10:06:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-10 10:06:24,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:24,721 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:06:24,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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-02-10 10:06:24,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:24,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:24,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:25,079 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 159 states. [2022-02-10 10:06:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:06:25,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-10 10:06:25,306 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,SelfDestructingSolverStorable2 [2022-02-10 10:06:25,306 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:06:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:06:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-02-10 10:06:25,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:06:25,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134357061] [2022-02-10 10:06:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:25,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:06:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:25,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:06:25,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134357061] [2022-02-10 10:06:25,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134357061] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 10:06:25,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640266790] [2022-02-10 10:06:25,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-10 10:06:25,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:06:25,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:06:25,408 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-02-10 10:06:25,409 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-02-10 10:06:25,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-10 10:06:25,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 10:06:25,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-10 10:06:25,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 10:06:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:25,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 10:06:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:25,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640266790] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 10:06:25,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 10:06:25,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-10 10:06:25,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438479290] [2022-02-10 10:06:25,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 10:06:25,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-10 10:06:25,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:06:25,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-10 10:06:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-10 10:06:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:25,784 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:06:25,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 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-02-10 10:06:25,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:25,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:25,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:06:25,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:26,212 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 244 states. [2022-02-10 10:06:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:06:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:06:26,232 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-02-10 10:06:26,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:06:26,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:06:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:06:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-02-10 10:06:26,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:06:26,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703637077] [2022-02-10 10:06:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:26,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:06:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:26,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:06:26,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703637077] [2022-02-10 10:06:26,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703637077] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 10:06:26,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328961223] [2022-02-10 10:06:26,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-10 10:06:26,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:06:26,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:06:26,572 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-02-10 10:06:26,573 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-02-10 10:06:26,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-10 10:06:26,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 10:06:26,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-10 10:06:26,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 10:06:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:26,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 10:06:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:27,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328961223] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 10:06:27,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 10:06:27,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-02-10 10:06:27,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902980802] [2022-02-10 10:06:27,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 10:06:27,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-10 10:06:27,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:06:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-10 10:06:27,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-02-10 10:06:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:27,147 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:06:27,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 10:06:27,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:27,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:27,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:06:27,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:06:27,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:27,853 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 367 transitions and produced 350 states. [2022-02-10 10:06:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:06:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:06:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:06:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:06:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-10 10:06:27,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-10 10:06:28,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:06:28,070 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:06:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:06:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2022-02-10 10:06:28,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:06:28,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428141257] [2022-02-10 10:06:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:06:28,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:06:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:06:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:29,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:06:29,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428141257] [2022-02-10 10:06:29,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428141257] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 10:06:29,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295374603] [2022-02-10 10:06:29,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-10 10:06:29,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:06:29,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:06:29,066 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-02-10 10:06:29,067 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-02-10 10:06:29,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-10 10:06:29,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-10 10:06:29,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-10 10:06:29,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 10:06:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:06:31,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 10:11:36,686 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 472 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:11:36,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295374603] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 10:11:36,688 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 10:11:36,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2022-02-10 10:11:36,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851013313] [2022-02-10 10:11:36,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 10:11:36,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-02-10 10:11:36,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:11:36,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-02-10 10:11:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=13487, Unknown=68, NotChecked=0, Total=14520 [2022-02-10 10:11:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:11:36,698 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:11:36,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.15702479338843) internal successors, (382), 121 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 10:11:36,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:11:36,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:11:36,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:11:36,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:11:36,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-10 10:11:36,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:12:12,220 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (* (- 1) c_~j~0)) (.cse4 (* (- 1) c_~i~0)) (.cse22 (* 2 c_~cur~0))) (let ((.cse0 (+ c_~prev~0 c_~cur~0)) (.cse3 (+ .cse22 c_~prev~0)) (.cse7 (div (+ (- 2) .cse4 c_~cur~0) (- 2))) (.cse6 (+ c_~next~0 1)) (.cse1 (+ c_~prev~0 c_~next~0)) (.cse5 (div (+ (- 2) .cse15 c_~cur~0) (- 2))) (.cse8 (+ c_~prev~0 1 c_~cur~0)) (.cse20 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse14 (+ .cse22 3 c_~prev~0)) (.cse9 (div (+ .cse15 (- 4) c_~next~0) (- 2))) (.cse19 (+ 2 c_~next~0 c_~cur~0)) (.cse17 (+ c_~next~0 c_~cur~0)) (.cse18 (div (+ .cse4 (- 4) c_~next~0) (- 2))) (.cse10 (+ 2 c_~prev~0 c_~next~0))) (and (<= c_~i~0 .cse0) (<= c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 .cse1) (<= c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse2 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse2 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse2 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= c_~j~0 .cse3) (<= (div (+ c_~prev~0 .cse4) (- 2)) c_~next~0) (<= c_~j~0 c_~prev~0) (<= .cse5 .cse6) (<= c_~i~0 c_~next~0) (<= .cse7 .cse8) (<= .cse9 .cse10) (forall ((v_~cur~0_22 Int)) (or (< v_~cur~0_22 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 8) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56)))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse11 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse11 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse11 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse12 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse12 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse12 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse13 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse13 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse13 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (<= (div (+ c_~prev~0 .cse4 (- 6) c_~cur~0) (- 2)) .cse14) (<= c_~j~0 c_~cur~0) (<= (div (+ c_~prev~0 .cse15) (- 2)) c_~next~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse16 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse16 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse16 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~j~0 8))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~j~0 .cse17) (<= c_~j~0 .cse0) (<= c_~i~0 .cse3) (<= .cse7 .cse6) (<= .cse18 .cse19) (<= 0 c_~prev~0) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~i~0 8))) (> 0 aux_mod_v_~next~0_20_56))) (<= (div (+ .cse4 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse20) (<= c_~j~0 .cse1) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 8) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse5 .cse8) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse15 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse20) (<= c_~i~0 c_~prev~0) (<= c_~i~0 c_~cur~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse21 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse21 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (<= c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ c_~prev~0 .cse15 (- 6) c_~cur~0) (- 2)) .cse14) (<= .cse9 .cse19) (<= c_~i~0 1) (<= c_~i~0 .cse17) (<= .cse18 .cse10) (<= 1 c_~cur~0) (forall ((v_~prev~0_24 Int)) (or (not (<= c_~cur~0 v_~prev~0_24)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))))))) is different from false [2022-02-10 10:12:12,338 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 401 transitions and produced 385 states. [2022-02-10 10:12:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:12:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:12:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:12:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:12:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-10 10:12:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-10 10:12:12,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-10 10:12:12,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:12:12,553 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:12:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:12:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1765864314, now seen corresponding path program 1 times [2022-02-10 10:12:12,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:12:12,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94053794] [2022-02-10 10:12:12,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:12:12,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:12:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:12:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-10 10:12:12,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:12:12,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94053794] [2022-02-10 10:12:12,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94053794] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 10:12:12,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 10:12:12,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 10:12:12,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549414641] [2022-02-10 10:12:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 10:12:12,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 10:12:12,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:12:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 10:12:12,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 10:12:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:12:12,649 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:12:12,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-02-10 10:12:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:12:16,672 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (* (- 1) c_~j~0)) (.cse6 (* (- 1) c_~i~0)) (.cse24 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0)) (.cse5 (+ .cse24 c_~prev~0)) (.cse9 (div (+ (- 2) .cse6 c_~cur~0) (- 2))) (.cse8 (+ c_~next~0 1)) (.cse3 (+ c_~prev~0 c_~next~0)) (.cse7 (div (+ (- 2) .cse17 c_~cur~0) (- 2))) (.cse10 (+ c_~prev~0 1 c_~cur~0)) (.cse22 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse16 (+ .cse24 3 c_~prev~0)) (.cse11 (div (+ .cse17 (- 4) c_~next~0) (- 2))) (.cse21 (+ 2 c_~next~0 c_~cur~0)) (.cse19 (+ c_~next~0 c_~cur~0)) (.cse20 (div (+ .cse6 (- 4) c_~next~0) (- 2))) (.cse12 (+ 2 c_~prev~0 c_~next~0))) (and (forall ((v_~j~0_8 Int)) (or (not (<= v_~j~0_8 1)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse0 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse0 c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 (* 2 aux_mod_v_~cur~0_22_51) 10 v_~j~0_8) (+ .cse0 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse1 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse1 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse1 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))))))) (<= c_~i~0 .cse2) (<= c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 .cse3) (<= c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse4 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse4 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse4 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= c_~j~0 .cse5) (<= (div (+ c_~prev~0 .cse6) (- 2)) c_~next~0) (<= c_~j~0 c_~prev~0) (<= .cse7 .cse8) (<= c_~i~0 c_~next~0) (<= .cse9 .cse10) (<= .cse11 .cse12) (forall ((v_~cur~0_22 Int)) (or (< v_~cur~0_22 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 8) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56)))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse13 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse13 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse13 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse14 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse14 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse14 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse15 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse15 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse15 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (<= (div (+ c_~prev~0 .cse6 (- 6) c_~cur~0) (- 2)) .cse16) (<= c_~j~0 c_~cur~0) (<= (div (+ c_~prev~0 .cse17) (- 2)) c_~next~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse18 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse18 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse18 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~j~0 8))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~j~0 .cse19) (<= c_~j~0 .cse2) (<= c_~i~0 .cse5) (<= .cse9 .cse8) (<= .cse20 .cse21) (<= 0 c_~prev~0) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~i~0 8))) (> 0 aux_mod_v_~next~0_20_56))) (<= (div (+ .cse6 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse22) (<= c_~j~0 .cse3) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 8) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse7 .cse10) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse17 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse22) (<= c_~i~0 c_~prev~0) (<= c_~i~0 c_~cur~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse23 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse23 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse23 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (<= c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ c_~prev~0 .cse17 (- 6) c_~cur~0) (- 2)) .cse16) (<= .cse11 .cse21) (<= c_~i~0 .cse19) (<= .cse20 .cse12) (<= 1 c_~cur~0) (forall ((v_~prev~0_24 Int)) (or (not (<= c_~cur~0 v_~prev~0_24)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))))))) is different from false [2022-02-10 10:12:16,781 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 387 transitions and produced 371 states. [2022-02-10 10:12:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:12:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:12:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:12:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:12:16,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-10 10:12:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-10 10:12:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:12:16,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 10:12:16,791 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 10:12:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 10:12:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash -820200619, now seen corresponding path program 1 times [2022-02-10 10:12:16,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 10:12:16,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580631483] [2022-02-10 10:12:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:12:16,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 10:12:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:12:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:12:19,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 10:12:19,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580631483] [2022-02-10 10:12:19,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580631483] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-10 10:12:19,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116309857] [2022-02-10 10:12:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 10:12:19,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-10 10:12:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 10:12:19,770 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-02-10 10:12:19,775 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-02-10 10:12:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 10:12:19,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-10 10:12:19,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-10 10:12:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 10:12:28,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-10 10:14:03,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~cur~0_39 Int)) (or (not (<= c_~next~0 v_~cur~0_39)) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse1 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse0 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse0 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse1 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse1) .cse0) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse3 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse2 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (< .cse2 (+ c_~j~0 c_~i~0 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104 11)) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 c_~i~0 .cse3 13 aux_mod_aux_mod_v_~next~0_33_71_104) .cse2))))) (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39)))))) is different from false [2022-02-10 10:16:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 461 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-10 10:16:55,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116309857] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-10 10:16:55,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-10 10:16:55,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 124 [2022-02-10 10:16:55,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380197115] [2022-02-10 10:16:55,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-10 10:16:55,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-02-10 10:16:55,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 10:16:55,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-02-10 10:16:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=14013, Unknown=49, NotChecked=242, Total=15252 [2022-02-10 10:16:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:16:55,163 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-10 10:16:55,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 3.225806451612903) internal successors, (400), 124 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-10 10:16:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-10 10:17:27,923 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) c_~i~0)) (.cse7 (+ c_~next~0 1)) (.cse2 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse17 (+ c_~next~0 c_~cur~0)) (.cse0 (* (- 1) c_~j~0)) (.cse16 (+ 2 c_~next~0 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ .cse0 .cse1 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse2) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse4 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse3 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse3 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse4 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse4) .cse3) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse6 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse5 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (< .cse5 (+ c_~j~0 c_~i~0 .cse6 aux_mod_aux_mod_v_~next~0_33_71_104 11)) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 c_~i~0 .cse6 13 aux_mod_aux_mod_v_~next~0_33_71_104) .cse5))))) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (<= (div (+ (- 2) .cse0 c_~cur~0) (- 2)) .cse7) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 c_~j~0 8) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ v_~cur~0_39 c_~cur~0)) (< v_~next~0_36 (+ (* 2 v_~cur~0_39) c_~cur~0)) (not (<= c_~next~0 v_~cur~0_39)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse9 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse8 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse8 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse9 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse9) .cse8) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse11 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse10 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (< .cse10 (+ c_~j~0 c_~i~0 .cse11 aux_mod_aux_mod_v_~next~0_33_71_104 11)) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 c_~i~0 .cse11 13 aux_mod_aux_mod_v_~next~0_33_71_104) .cse10))))))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse12 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse12 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse13 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse13) .cse12) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse15 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse14 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (< .cse14 (+ c_~j~0 c_~i~0 .cse15 aux_mod_aux_mod_v_~next~0_33_71_104 11)) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 c_~i~0 .cse15 13 aux_mod_aux_mod_v_~next~0_33_71_104) .cse14))))) (< v_~prev~0_37 c_~next~0) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (= (+ (- 1) c_~j~0) 0) (<= 1 c_~next~0) (<= (div (+ .cse0 .cse1 (- 4) c_~next~0) (- 2)) .cse16) (<= c_~j~0 .cse17) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ (* aux_mod_v_~next~0_33_71 2) 20 (* 2 c_~i~0) (* 2 c_~j~0))) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 c_~i~0 8) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (> 0 aux_mod_v_~next~0_33_71) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse19 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse18 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse18) .cse19) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse19 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse18 11)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse21 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse20 (+ (* v_~prev~0_37 3) c_~next~0))) (or (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (< .cse20 (+ c_~j~0 c_~i~0 .cse21 aux_mod_aux_mod_v_~next~0_33_71_104 11)) (<= (+ c_~j~0 c_~i~0 .cse21 13 aux_mod_aux_mod_v_~next~0_33_71_104) .cse20))))))) (<= (div (+ (- 2) .cse0 .cse1 c_~cur~0) (- 2)) .cse7) (<= (div (+ .cse0 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse2) (<= (+ c_~j~0 c_~i~0) .cse17) (<= (div (+ .cse0 (- 4) c_~next~0) (- 2)) .cse16) (= (+ (- 1) c_~prev~0) 0) (<= 1 c_~cur~0) (forall ((v_~cur~0_35 Int)) (or (and (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (< (+ aux_mod_v_~next~0_33_71 c_~j~0 c_~i~0 8) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (>= aux_mod_v_~next~0_33_71 2) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ (* aux_mod_v_~next~0_33_71 2) 20 (* 2 c_~i~0) (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_33_71))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 8) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0))))) (not (<= c_~next~0 v_~cur~0_35)))))) is different from false Received shutdown request... [2022-02-10 10:21:03,518 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-10 10:21:03,518 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-02-10 10:21:03,518 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-10 10:21:04,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-02-10 10:21:04,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-10 10:21:04,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 10:21:04,697 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-02-10 10:21:04,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-10 10:21:04,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-10 10:21:04,699 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-10 10:21:04,703 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-02-10 10:21:04,705 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 10:21:04,705 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 10:21:04,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 10:21:04 BasicIcfg [2022-02-10 10:21:04,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 10:21:04,707 INFO L158 Benchmark]: Toolchain (without parser) took 882346.32ms. Allocated memory was 154.1MB in the beginning and 474.0MB in the end (delta: 319.8MB). Free memory was 130.5MB in the beginning and 300.8MB in the end (delta: -170.3MB). Peak memory consumption was 149.5MB. Max. memory is 8.0GB. [2022-02-10 10:21:04,707 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 154.1MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 10:21:04,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.19ms. Allocated memory was 154.1MB in the beginning and 212.9MB in the end (delta: 58.7MB). Free memory was 130.2MB in the beginning and 179.5MB in the end (delta: -49.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-02-10 10:21:04,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 212.9MB. Free memory was 179.5MB in the beginning and 177.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 10:21:04,714 INFO L158 Benchmark]: Boogie Preprocessor took 30.22ms. Allocated memory is still 212.9MB. Free memory was 177.8MB in the beginning and 176.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 10:21:04,727 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-10 10:21:04,729 INFO L158 Benchmark]: RCFGBuilder took 352.59ms. Allocated memory is still 212.9MB. Free memory was 176.4MB in the beginning and 163.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-10 10:21:04,729 INFO L158 Benchmark]: TraceAbstraction took 881469.87ms. Allocated memory was 212.9MB in the beginning and 474.0MB in the end (delta: 261.1MB). Free memory was 163.3MB in the beginning and 300.8MB in the end (delta: -137.5MB). Peak memory consumption was 124.6MB. Max. memory is 8.0GB. [2022-02-10 10:21:04,733 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.11ms. Allocated memory is still 154.1MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.19ms. Allocated memory was 154.1MB in the beginning and 212.9MB in the end (delta: 58.7MB). Free memory was 130.2MB in the beginning and 179.5MB in the end (delta: -49.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 212.9MB. Free memory was 179.5MB in the beginning and 177.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.22ms. Allocated memory is still 212.9MB. Free memory was 177.8MB in the beginning and 176.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 352.59ms. Allocated memory is still 212.9MB. Free memory was 176.4MB in the beginning and 163.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 881469.87ms. Allocated memory was 212.9MB in the beginning and 474.0MB in the end (delta: 261.1MB). Free memory was 163.3MB in the beginning and 300.8MB in the end (delta: -137.5MB). Peak memory consumption was 124.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 726]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 881.4s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 291.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 588.2s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1784 ConstructedInterpolants, 148 QuantifiedInterpolants, 28763 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1116 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 1144/3855 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