/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 01:45:14,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 01:45:14,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 01:45:15,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 01:45:15,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 01:45:15,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 01:45:15,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 01:45:15,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 01:45:15,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 01:45:15,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 01:45:15,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 01:45:15,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 01:45:15,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 01:45:15,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 01:45:15,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 01:45:15,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 01:45:15,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 01:45:15,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 01:45:15,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 01:45:15,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 01:45:15,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 01:45:15,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 01:45:15,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 01:45:15,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 01:45:15,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 01:45:15,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 01:45:15,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 01:45:15,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 01:45:15,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 01:45:15,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 01:45:15,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 01:45:15,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 01:45:15,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 01:45:15,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 01:45:15,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 01:45:15,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 01:45:15,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 01:45:15,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 01:45:15,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 01:45:15,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 01:45:15,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 01:45:15,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 01:45:15,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-19 01:45:15,083 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 01:45:15,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 01:45:15,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 01:45:15,085 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 01:45:15,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 01:45:15,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 01:45:15,086 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 01:45:15,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 01:45:15,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 01:45:15,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 01:45:15,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 01:45:15,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 01:45:15,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 01:45:15,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-19 01:45:15,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-19 01:45:15,089 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-19 01:45:15,089 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 01:45:15,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 01:45:15,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 01:45:15,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 01:45:15,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 01:45:15,252 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 01:45:15,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-03-19 01:45:15,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b7e6f8e/80e7e52885794ef3a4919f01eb110ff3/FLAG7ff0bc50a [2022-03-19 01:45:15,665 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 01:45:15,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-03-19 01:45:15,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b7e6f8e/80e7e52885794ef3a4919f01eb110ff3/FLAG7ff0bc50a [2022-03-19 01:45:15,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b7e6f8e/80e7e52885794ef3a4919f01eb110ff3 [2022-03-19 01:45:15,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 01:45:15,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-19 01:45:15,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 01:45:15,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 01:45:15,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 01:45:15,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b2bd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15, skipping insertion in model container [2022-03-19 01:45:15,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 01:45:15,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 01:45:15,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-03-19 01:45:15,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 01:45:15,854 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 01:45:15,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2022-03-19 01:45:15,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 01:45:15,876 INFO L208 MainTranslator]: Completed translation [2022-03-19 01:45:15,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15 WrapperNode [2022-03-19 01:45:15,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 01:45:15,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 01:45:15,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 01:45:15,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 01:45:15,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 01:45:15,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 01:45:15,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 01:45:15,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 01:45:15,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (1/1) ... [2022-03-19 01:45:15,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 01:45:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 01:45:15,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 01:45:15,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 01:45:15,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 01:45:15,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 01:45:15,960 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 01:45:15,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 01:45:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 01:45:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 01:45:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 01:45:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 01:45:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 01:45:15,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 01:45:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 01:45:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 01:45:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 01:45:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 01:45:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 01:45:15,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 01:45:16,006 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 01:45:16,007 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 01:45:16,145 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 01:45:16,149 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 01:45:16,150 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 01:45:16,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:45:16 BoogieIcfgContainer [2022-03-19 01:45:16,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 01:45:16,152 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-19 01:45:16,152 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-19 01:45:16,153 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-19 01:45:16,155 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:45:16" (1/1) ... [2022-03-19 01:45:16,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 19.03 01:45:16 BasicIcfg [2022-03-19 01:45:16,185 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-19 01:45:16,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 01:45:16,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 01:45:16,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 01:45:16,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 01:45:15" (1/4) ... [2022-03-19 01:45:16,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d52c991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:45:16, skipping insertion in model container [2022-03-19 01:45:16,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:45:15" (2/4) ... [2022-03-19 01:45:16,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d52c991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:45:16, skipping insertion in model container [2022-03-19 01:45:16,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:45:16" (3/4) ... [2022-03-19 01:45:16,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d52c991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 01:45:16, skipping insertion in model container [2022-03-19 01:45:16,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 19.03 01:45:16" (4/4) ... [2022-03-19 01:45:16,190 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.cqvasr [2022-03-19 01:45:16,194 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 01:45:16,194 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 01:45:16,227 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 01:45:16,248 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 01:45:16,248 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 01:45:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 01:45:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 01:45:16,266 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:16,266 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:16,267 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -655326661, now seen corresponding path program 1 times [2022-03-19 01:45:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:16,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931635908] [2022-03-19 01:45:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:16,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:16,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931635908] [2022-03-19 01:45:16,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931635908] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:16,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:16,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:16,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519443670] [2022-03-19 01:45:16,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:16,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:16,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:16,502 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:16,621 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-03-19 01:45:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:16,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-19 01:45:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:16,634 INFO L225 Difference]: With dead ends: 58 [2022-03-19 01:45:16,636 INFO L226 Difference]: Without dead ends: 43 [2022-03-19 01:45:16,638 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:16,643 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:16,644 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 01:45:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-19 01:45:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-03-19 01:45:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-03-19 01:45:16,690 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-03-19 01:45:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:16,690 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-03-19 01:45:16,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-03-19 01:45:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 01:45:16,691 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:16,691 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:16,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 01:45:16,692 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1087483674, now seen corresponding path program 1 times [2022-03-19 01:45:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:16,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913408013] [2022-03-19 01:45:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913408013] [2022-03-19 01:45:16,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913408013] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:16,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981394306] [2022-03-19 01:45:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:16,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:16,761 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:16,805 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-03-19 01:45:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-19 01:45:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:16,806 INFO L225 Difference]: With dead ends: 68 [2022-03-19 01:45:16,806 INFO L226 Difference]: Without dead ends: 43 [2022-03-19 01:45:16,806 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:16,807 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:16,808 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-19 01:45:16,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-03-19 01:45:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-03-19 01:45:16,813 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-03-19 01:45:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:16,813 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-03-19 01:45:16,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-03-19 01:45:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 01:45:16,814 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:16,814 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:16,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 01:45:16,815 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1159741911, now seen corresponding path program 1 times [2022-03-19 01:45:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:16,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378415459] [2022-03-19 01:45:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:16,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378415459] [2022-03-19 01:45:16,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378415459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:16,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:16,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390696303] [2022-03-19 01:45:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:16,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:16,874 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:16,928 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-03-19 01:45:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-19 01:45:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:16,930 INFO L225 Difference]: With dead ends: 64 [2022-03-19 01:45:16,930 INFO L226 Difference]: Without dead ends: 46 [2022-03-19 01:45:16,930 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:16,931 INFO L912 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:16,931 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-19 01:45:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-03-19 01:45:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-03-19 01:45:16,937 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-03-19 01:45:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:16,937 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-03-19 01:45:16,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-03-19 01:45:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 01:45:16,938 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:16,938 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:16,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 01:45:16,938 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -647712552, now seen corresponding path program 1 times [2022-03-19 01:45:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947152437] [2022-03-19 01:45:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:16,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947152437] [2022-03-19 01:45:16,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947152437] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:16,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:16,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327772467] [2022-03-19 01:45:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:16,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:16,993 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,032 INFO L93 Difference]: Finished difference Result 77 states and 121 transitions. [2022-03-19 01:45:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-19 01:45:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,033 INFO L225 Difference]: With dead ends: 77 [2022-03-19 01:45:17,034 INFO L226 Difference]: Without dead ends: 75 [2022-03-19 01:45:17,034 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,035 INFO L912 BasicCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,035 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-19 01:45:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2022-03-19 01:45:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 53 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 89 transitions. [2022-03-19 01:45:17,041 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 89 transitions. Word has length 17 [2022-03-19 01:45:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,041 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 89 transitions. [2022-03-19 01:45:17,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 89 transitions. [2022-03-19 01:45:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 01:45:17,042 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,042 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 01:45:17,042 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1095097783, now seen corresponding path program 1 times [2022-03-19 01:45:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046005347] [2022-03-19 01:45:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046005347] [2022-03-19 01:45:17,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046005347] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467783580] [2022-03-19 01:45:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,100 INFO L87 Difference]: Start difference. First operand 57 states and 89 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,154 INFO L93 Difference]: Finished difference Result 125 states and 199 transitions. [2022-03-19 01:45:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-19 01:45:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,155 INFO L225 Difference]: With dead ends: 125 [2022-03-19 01:45:17,155 INFO L226 Difference]: Without dead ends: 77 [2022-03-19 01:45:17,156 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,157 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,157 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-19 01:45:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-03-19 01:45:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-03-19 01:45:17,165 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-03-19 01:45:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,165 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-03-19 01:45:17,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-03-19 01:45:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 01:45:17,166 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,166 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 01:45:17,167 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1395779414, now seen corresponding path program 1 times [2022-03-19 01:45:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586612579] [2022-03-19 01:45:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586612579] [2022-03-19 01:45:17,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586612579] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72069610] [2022-03-19 01:45:17,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,197 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,232 INFO L93 Difference]: Finished difference Result 112 states and 170 transitions. [2022-03-19 01:45:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-19 01:45:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,233 INFO L225 Difference]: With dead ends: 112 [2022-03-19 01:45:17,233 INFO L226 Difference]: Without dead ends: 79 [2022-03-19 01:45:17,233 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,238 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 65 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,238 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-03-19 01:45:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-03-19 01:45:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2022-03-19 01:45:17,245 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 18 [2022-03-19 01:45:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,245 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2022-03-19 01:45:17,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2022-03-19 01:45:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 01:45:17,246 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,246 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 01:45:17,247 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash -411675049, now seen corresponding path program 1 times [2022-03-19 01:45:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269342590] [2022-03-19 01:45:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269342590] [2022-03-19 01:45:17,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269342590] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186035308] [2022-03-19 01:45:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,290 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,367 INFO L93 Difference]: Finished difference Result 133 states and 201 transitions. [2022-03-19 01:45:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-19 01:45:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,368 INFO L225 Difference]: With dead ends: 133 [2022-03-19 01:45:17,368 INFO L226 Difference]: Without dead ends: 131 [2022-03-19 01:45:17,368 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,369 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,369 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 01:45:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-03-19 01:45:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2022-03-19 01:45:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.504950495049505) internal successors, (152), 101 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2022-03-19 01:45:17,376 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 18 [2022-03-19 01:45:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,376 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2022-03-19 01:45:17,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2022-03-19 01:45:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 01:45:17,377 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,377 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 01:45:17,377 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1331135286, now seen corresponding path program 1 times [2022-03-19 01:45:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989265581] [2022-03-19 01:45:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989265581] [2022-03-19 01:45:17,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989265581] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383791119] [2022-03-19 01:45:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,403 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,435 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2022-03-19 01:45:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-19 01:45:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,436 INFO L225 Difference]: With dead ends: 233 [2022-03-19 01:45:17,436 INFO L226 Difference]: Without dead ends: 139 [2022-03-19 01:45:17,437 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,437 INFO L912 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,438 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-03-19 01:45:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2022-03-19 01:45:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2022-03-19 01:45:17,444 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 18 [2022-03-19 01:45:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,445 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2022-03-19 01:45:17,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2022-03-19 01:45:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 01:45:17,445 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,445 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 01:45:17,446 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 123007539, now seen corresponding path program 1 times [2022-03-19 01:45:17,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118408718] [2022-03-19 01:45:17,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118408718] [2022-03-19 01:45:17,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118408718] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508343876] [2022-03-19 01:45:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,472 INFO L87 Difference]: Start difference. First operand 137 states and 195 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,502 INFO L93 Difference]: Finished difference Result 205 states and 289 transitions. [2022-03-19 01:45:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-19 01:45:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,503 INFO L225 Difference]: With dead ends: 205 [2022-03-19 01:45:17,503 INFO L226 Difference]: Without dead ends: 143 [2022-03-19 01:45:17,503 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,504 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,504 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-03-19 01:45:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-03-19 01:45:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 137 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2022-03-19 01:45:17,510 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 19 [2022-03-19 01:45:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,510 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2022-03-19 01:45:17,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2022-03-19 01:45:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 01:45:17,511 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,511 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 01:45:17,511 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1684446924, now seen corresponding path program 1 times [2022-03-19 01:45:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053930210] [2022-03-19 01:45:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053930210] [2022-03-19 01:45:17,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053930210] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146681419] [2022-03-19 01:45:17,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,536 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,568 INFO L93 Difference]: Finished difference Result 237 states and 329 transitions. [2022-03-19 01:45:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-19 01:45:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,570 INFO L225 Difference]: With dead ends: 237 [2022-03-19 01:45:17,570 INFO L226 Difference]: Without dead ends: 235 [2022-03-19 01:45:17,570 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,571 INFO L912 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,571 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-03-19 01:45:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-03-19 01:45:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.3604060913705585) internal successors, (268), 197 states have internal predecessors, (268), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 271 transitions. [2022-03-19 01:45:17,578 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 271 transitions. Word has length 19 [2022-03-19 01:45:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,578 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 271 transitions. [2022-03-19 01:45:17,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 271 transitions. [2022-03-19 01:45:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 01:45:17,579 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,579 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 01:45:17,579 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 58363411, now seen corresponding path program 1 times [2022-03-19 01:45:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399711004] [2022-03-19 01:45:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399711004] [2022-03-19 01:45:17,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399711004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086876158] [2022-03-19 01:45:17,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,602 INFO L87 Difference]: Start difference. First operand 201 states and 271 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,643 INFO L93 Difference]: Finished difference Result 445 states and 593 transitions. [2022-03-19 01:45:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-19 01:45:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,645 INFO L225 Difference]: With dead ends: 445 [2022-03-19 01:45:17,645 INFO L226 Difference]: Without dead ends: 259 [2022-03-19 01:45:17,646 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,647 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,647 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-19 01:45:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-03-19 01:45:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 253 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 327 transitions. [2022-03-19 01:45:17,655 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 327 transitions. Word has length 19 [2022-03-19 01:45:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,655 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 327 transitions. [2022-03-19 01:45:17,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 327 transitions. [2022-03-19 01:45:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 01:45:17,656 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,656 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 01:45:17,656 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -678214798, now seen corresponding path program 1 times [2022-03-19 01:45:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930155331] [2022-03-19 01:45:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930155331] [2022-03-19 01:45:17,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930155331] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948559492] [2022-03-19 01:45:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,701 INFO L87 Difference]: Start difference. First operand 257 states and 327 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,733 INFO L93 Difference]: Finished difference Result 385 states and 485 transitions. [2022-03-19 01:45:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-19 01:45:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,736 INFO L225 Difference]: With dead ends: 385 [2022-03-19 01:45:17,736 INFO L226 Difference]: Without dead ends: 267 [2022-03-19 01:45:17,736 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,737 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,737 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-03-19 01:45:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-03-19 01:45:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 261 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2022-03-19 01:45:17,745 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 20 [2022-03-19 01:45:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,745 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2022-03-19 01:45:17,745 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2022-03-19 01:45:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 01:45:17,746 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,746 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 01:45:17,746 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1809298035, now seen corresponding path program 1 times [2022-03-19 01:45:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654952042] [2022-03-19 01:45:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654952042] [2022-03-19 01:45:17,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654952042] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960335886] [2022-03-19 01:45:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,803 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,840 INFO L93 Difference]: Finished difference Result 427 states and 520 transitions. [2022-03-19 01:45:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-19 01:45:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,842 INFO L225 Difference]: With dead ends: 427 [2022-03-19 01:45:17,842 INFO L226 Difference]: Without dead ends: 425 [2022-03-19 01:45:17,843 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,844 INFO L912 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,844 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-03-19 01:45:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-03-19 01:45:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2030848329048842) internal successors, (468), 389 states have internal predecessors, (468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 471 transitions. [2022-03-19 01:45:17,854 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 471 transitions. Word has length 20 [2022-03-19 01:45:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,854 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 471 transitions. [2022-03-19 01:45:17,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 471 transitions. [2022-03-19 01:45:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 01:45:17,856 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 01:45:17,857 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:17,857 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 01:45:17,857 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 01:45:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 01:45:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash -742858926, now seen corresponding path program 1 times [2022-03-19 01:45:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 01:45:17,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243966618] [2022-03-19 01:45:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 01:45:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 01:45:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 01:45:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 01:45:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 01:45:17,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 01:45:17,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243966618] [2022-03-19 01:45:17,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243966618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 01:45:17,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 01:45:17,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 01:45:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168651378] [2022-03-19 01:45:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 01:45:17,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 01:45:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 01:45:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 01:45:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 01:45:17,897 INFO L87 Difference]: Start difference. First operand 393 states and 471 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 01:45:17,930 INFO L93 Difference]: Finished difference Result 857 states and 999 transitions. [2022-03-19 01:45:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 01:45:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-19 01:45:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 01:45:17,932 INFO L225 Difference]: With dead ends: 857 [2022-03-19 01:45:17,932 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 01:45:17,933 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 01:45:17,933 INFO L912 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 01:45:17,933 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 01:45:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 01:45:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 01:45:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 01:45:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 01:45:17,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-03-19 01:45:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 01:45:17,935 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 01:45:17,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 01:45:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 01:45:17,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 01:45:17,937 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 01:45:17,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 01:45:17,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 01:45:18,289 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 01:45:18,289 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-03-19 01:45:18,289 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-03-19 01:45:18,289 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 01:45:18,289 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 01:45:18,289 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-03-19 01:45:18,289 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-03-19 01:45:18,290 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-03-19 01:45:18,290 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-03-19 01:45:18,290 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-03-19 01:45:18,290 INFO L882 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2022-03-19 01:45:18,290 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 95) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 95) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-03-19 01:45:18,291 INFO L882 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,292 INFO L882 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-03-19 01:45:18,292 INFO L882 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2022-03-19 01:45:18,292 INFO L882 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-03-19 01:45:18,294 INFO L718 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 01:45:18,295 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 01:45:18,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 01:45:18 BasicIcfg [2022-03-19 01:45:18,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 01:45:18,303 INFO L158 Benchmark]: Toolchain (without parser) took 2618.96ms. Allocated memory was 210.8MB in the beginning and 345.0MB in the end (delta: 134.2MB). Free memory was 153.0MB in the beginning and 250.5MB in the end (delta: -97.5MB). Peak memory consumption was 171.1MB. Max. memory is 8.0GB. [2022-03-19 01:45:18,303 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 169.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 01:45:18,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.87ms. Allocated memory was 210.8MB in the beginning and 345.0MB in the end (delta: 134.2MB). Free memory was 152.8MB in the beginning and 316.7MB in the end (delta: -163.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-03-19 01:45:18,304 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 345.0MB. Free memory was 316.7MB in the beginning and 315.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 01:45:18,304 INFO L158 Benchmark]: RCFGBuilder took 245.55ms. Allocated memory is still 345.0MB. Free memory was 315.1MB in the beginning and 304.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-19 01:45:18,304 INFO L158 Benchmark]: IcfgTransformer took 33.04ms. Allocated memory is still 345.0MB. Free memory was 304.1MB in the beginning and 303.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 01:45:18,305 INFO L158 Benchmark]: TraceAbstraction took 2116.68ms. Allocated memory is still 345.0MB. Free memory was 302.5MB in the beginning and 250.5MB in the end (delta: 52.0MB). Peak memory consumption was 186.7MB. Max. memory is 8.0GB. [2022-03-19 01:45:18,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 210.8MB. Free memory is still 169.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.87ms. Allocated memory was 210.8MB in the beginning and 345.0MB in the end (delta: 134.2MB). Free memory was 152.8MB in the beginning and 316.7MB in the end (delta: -163.9MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 345.0MB. Free memory was 316.7MB in the beginning and 315.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 245.55ms. Allocated memory is still 345.0MB. Free memory was 315.1MB in the beginning and 304.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.04ms. Allocated memory is still 345.0MB. Free memory was 304.1MB in the beginning and 303.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2116.68ms. Allocated memory is still 345.0MB. Free memory was 302.5MB in the beginning and 250.5MB in the end (delta: 52.0MB). Peak memory consumption was 186.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 910 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 910 mSDsluCounter, 768 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 462 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 668 mSDtfsCounter, 462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=13, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 494 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-03-19 01:45:18,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...