/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-30 21:44:50,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-30 21:44:50,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-30 21:44:50,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-30 21:44:50,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-30 21:44:50,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-30 21:44:50,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-30 21:44:50,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-30 21:44:50,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-30 21:44:50,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-30 21:44:50,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-30 21:44:50,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-30 21:44:50,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-30 21:44:50,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-30 21:44:50,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-30 21:44:50,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-30 21:44:50,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-30 21:44:50,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-30 21:44:50,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-30 21:44:50,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-30 21:44:50,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-30 21:44:50,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-30 21:44:50,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-30 21:44:50,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-30 21:44:50,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-30 21:44:50,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-30 21:44:50,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-30 21:44:50,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-30 21:44:50,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-30 21:44:50,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-30 21:44:50,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-30 21:44:50,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-30 21:44:50,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-30 21:44:50,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-30 21:44:50,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-30 21:44:50,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-30 21:44:50,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-30 21:44:50,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-30 21:44:50,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-30 21:44:50,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-30 21:44:50,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-30 21:44:50,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-30 21:44:50,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-30 21:44:50,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-30 21:44:50,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-30 21:44:50,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-30 21:44:50,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-30 21:44:50,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-30 21:44:50,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * Use SBE=true [2022-01-30 21:44:50,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-30 21:44:50,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-30 21:44:50,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-30 21:44:50,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-30 21:44:50,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 21:44:50,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-30 21:44:50,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-30 21:44:50,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-30 21:44:50,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-30 21:44:50,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-30 21:44:50,251 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-30 21:44:50,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-30 21:44:50,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-30 21:44:50,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-01-30 21:44:50,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-30 21:44:50,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-30 21:44:50,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-30 21:44:50,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-30 21:44:50,425 INFO L275 PluginConnector]: CDTParser initialized [2022-01-30 21:44:50,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2022-01-30 21:44:50,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05a086a4/890b467fd6d241b8aa8eb06c02472e56/FLAGfc72cb061 [2022-01-30 21:44:50,802 INFO L306 CDTParser]: Found 1 translation units. [2022-01-30 21:44:50,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2022-01-30 21:44:50,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05a086a4/890b467fd6d241b8aa8eb06c02472e56/FLAGfc72cb061 [2022-01-30 21:44:50,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e05a086a4/890b467fd6d241b8aa8eb06c02472e56 [2022-01-30 21:44:50,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-30 21:44:50,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-30 21:44:50,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-30 21:44:50,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-30 21:44:50,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-30 21:44:50,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 09:44:50" (1/1) ... [2022-01-30 21:44:50,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11702377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:50, skipping insertion in model container [2022-01-30 21:44:50,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 09:44:50" (1/1) ... [2022-01-30 21:44:50,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-30 21:44:50,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-30 21:44:51,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2022-01-30 21:44:51,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 21:44:51,032 INFO L203 MainTranslator]: Completed pre-run [2022-01-30 21:44:51,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i[959,972] [2022-01-30 21:44:51,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 21:44:51,062 INFO L208 MainTranslator]: Completed translation [2022-01-30 21:44:51,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51 WrapperNode [2022-01-30 21:44:51,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-30 21:44:51,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-30 21:44:51,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-30 21:44:51,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-30 21:44:51,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-30 21:44:51,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-30 21:44:51,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-30 21:44:51,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-30 21:44:51,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (1/1) ... [2022-01-30 21:44:51,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 21:44:51,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:51,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-30 21:44:51,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-30 21:44:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-30 21:44:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-30 21:44:51,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-30 21:44:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-30 21:44:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2022-01-30 21:44:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure init [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-30 21:44:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-30 21:44:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-30 21:44:51,243 INFO L234 CfgBuilder]: Building ICFG [2022-01-30 21:44:51,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-30 21:44:51,345 INFO L275 CfgBuilder]: Performing block encoding [2022-01-30 21:44:51,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-30 21:44:51,350 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-30 21:44:51,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 09:44:51 BoogieIcfgContainer [2022-01-30 21:44:51,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-30 21:44:51,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-30 21:44:51,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-30 21:44:51,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-30 21:44:51,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 09:44:50" (1/3) ... [2022-01-30 21:44:51,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a17d0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 09:44:51, skipping insertion in model container [2022-01-30 21:44:51,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 09:44:51" (2/3) ... [2022-01-30 21:44:51,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a17d0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 09:44:51, skipping insertion in model container [2022-01-30 21:44:51,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 09:44:51" (3/3) ... [2022-01-30 21:44:51,360 INFO L111 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2022-01-30 21:44:51,372 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-30 21:44:51,372 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-30 21:44:51,411 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-30 21:44:51,418 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-30 21:44:51,419 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-30 21:44:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 21:44:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-30 21:44:51,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:51,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:51,434 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:51,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1552187691, now seen corresponding path program 1 times [2022-01-30 21:44:51,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694474413] [2022-01-30 21:44:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:51,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 21:44:51,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:51,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694474413] [2022-01-30 21:44:51,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694474413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 21:44:51,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 21:44:51,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-30 21:44:51,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019995585] [2022-01-30 21:44:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 21:44:51,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 21:44:51,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 21:44:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 21:44:51,623 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:51,726 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-01-30 21:44:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-30 21:44:51,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-30 21:44:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:51,737 INFO L225 Difference]: With dead ends: 59 [2022-01-30 21:44:51,738 INFO L226 Difference]: Without dead ends: 31 [2022-01-30 21:44:51,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-01-30 21:44:51,744 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:51,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 21:44:51,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-30 21:44:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-01-30 21:44:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 21:44:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-30 21:44:51,779 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-01-30 21:44:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:51,780 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-30 21:44:51,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-30 21:44:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-30 21:44:51,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:51,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:51,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-30 21:44:51,783 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash -22761210, now seen corresponding path program 1 times [2022-01-30 21:44:51,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:51,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935152555] [2022-01-30 21:44:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:51,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 21:44:51,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:51,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935152555] [2022-01-30 21:44:51,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935152555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 21:44:51,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 21:44:51,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-30 21:44:51,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727940888] [2022-01-30 21:44:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 21:44:51,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-30 21:44:51,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:51,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-30 21:44:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-30 21:44:51,863 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:51,946 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-30 21:44:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-30 21:44:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-30 21:44:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:51,948 INFO L225 Difference]: With dead ends: 51 [2022-01-30 21:44:51,948 INFO L226 Difference]: Without dead ends: 39 [2022-01-30 21:44:51,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-30 21:44:51,949 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:51,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 24 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 21:44:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-30 21:44:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-01-30 21:44:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 21:44:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-30 21:44:51,956 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2022-01-30 21:44:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:51,956 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-30 21:44:51,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-30 21:44:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-30 21:44:51,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:51,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:51,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-30 21:44:51,957 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:51,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1516983208, now seen corresponding path program 1 times [2022-01-30 21:44:51,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:51,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637751919] [2022-01-30 21:44:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:51,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 21:44:52,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637751919] [2022-01-30 21:44:52,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637751919] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096640681] [2022-01-30 21:44:52,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:52,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:52,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:52,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:52,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-30 21:44:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-30 21:44:52,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 21:44:52,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-30 21:44:52,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096640681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 21:44:52,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-30 21:44:52,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-01-30 21:44:52,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447425827] [2022-01-30 21:44:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 21:44:52,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-30 21:44:52,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-30 21:44:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-30 21:44:52,172 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:52,187 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-01-30 21:44:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-30 21:44:52,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-30 21:44:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:52,189 INFO L225 Difference]: With dead ends: 47 [2022-01-30 21:44:52,189 INFO L226 Difference]: Without dead ends: 29 [2022-01-30 21:44:52,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-30 21:44:52,192 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:52,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-30 21:44:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-30 21:44:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-30 21:44:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 21:44:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-30 21:44:52,198 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2022-01-30 21:44:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:52,198 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-30 21:44:52,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-30 21:44:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-30 21:44:52,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:52,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:52,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-30 21:44:52,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:52,421 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1123956198, now seen corresponding path program 1 times [2022-01-30 21:44:52,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:52,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053469826] [2022-01-30 21:44:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:52,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 21:44:52,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053469826] [2022-01-30 21:44:52,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053469826] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483301388] [2022-01-30 21:44:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:52,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:52,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:52,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-30 21:44:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-30 21:44:52,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 21:44:52,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-30 21:44:52,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483301388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 21:44:52,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-30 21:44:52,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-01-30 21:44:52,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958901382] [2022-01-30 21:44:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 21:44:52,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 21:44:52,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 21:44:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-30 21:44:52,581 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:52,598 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-01-30 21:44:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-30 21:44:52,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-30 21:44:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:52,599 INFO L225 Difference]: With dead ends: 50 [2022-01-30 21:44:52,599 INFO L226 Difference]: Without dead ends: 31 [2022-01-30 21:44:52,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-30 21:44:52,600 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:52,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-30 21:44:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-30 21:44:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-30 21:44:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 21:44:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-01-30 21:44:52,603 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2022-01-30 21:44:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:52,604 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-01-30 21:44:52,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-30 21:44:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-01-30 21:44:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-30 21:44:52,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:52,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:52,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-30 21:44:52,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-30 21:44:52,821 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:52,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:52,822 INFO L85 PathProgramCache]: Analyzing trace with hash -974628668, now seen corresponding path program 1 times [2022-01-30 21:44:52,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:52,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616935762] [2022-01-30 21:44:52,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:52,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 21:44:52,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616935762] [2022-01-30 21:44:52,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616935762] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473886755] [2022-01-30 21:44:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:52,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:52,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:52,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-30 21:44:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:52,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-30 21:44:52,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 21:44:52,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 21:44:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 21:44:53,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473886755] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 21:44:53,096 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 21:44:53,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-01-30 21:44:53,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435471601] [2022-01-30 21:44:53,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 21:44:53,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-30 21:44:53,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-30 21:44:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-30 21:44:53,098 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-30 21:44:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:53,319 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-01-30 21:44:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-30 21:44:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-01-30 21:44:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:53,321 INFO L225 Difference]: With dead ends: 72 [2022-01-30 21:44:53,321 INFO L226 Difference]: Without dead ends: 51 [2022-01-30 21:44:53,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2022-01-30 21:44:53,322 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 73 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:53,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 27 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 21:44:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-30 21:44:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2022-01-30 21:44:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 21:44:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-01-30 21:44:53,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2022-01-30 21:44:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:53,327 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-01-30 21:44:53,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-30 21:44:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-01-30 21:44:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-30 21:44:53,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:53,328 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:53,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-30 21:44:53,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:53,545 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 405226382, now seen corresponding path program 2 times [2022-01-30 21:44:53,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:53,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880929701] [2022-01-30 21:44:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:53,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:53,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-30 21:44:53,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:53,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880929701] [2022-01-30 21:44:53,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880929701] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:53,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353227283] [2022-01-30 21:44:53,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 21:44:53,611 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:53,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:53,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-30 21:44:53,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 21:44:53,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 21:44:53,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-30 21:44:53,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-30 21:44:53,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 21:44:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-30 21:44:53,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353227283] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 21:44:53,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 21:44:53,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2022-01-30 21:44:53,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517387171] [2022-01-30 21:44:53,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 21:44:53,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-30 21:44:54,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:54,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-30 21:44:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-01-30 21:44:54,000 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-30 21:44:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:54,348 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-01-30 21:44:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-30 21:44:54,348 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2022-01-30 21:44:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:54,349 INFO L225 Difference]: With dead ends: 95 [2022-01-30 21:44:54,349 INFO L226 Difference]: Without dead ends: 71 [2022-01-30 21:44:54,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=957, Unknown=0, NotChecked=0, Total=1260 [2022-01-30 21:44:54,350 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 107 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:54,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 29 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 21:44:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-30 21:44:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2022-01-30 21:44:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 21:44:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-01-30 21:44:54,356 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 34 [2022-01-30 21:44:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:54,356 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-01-30 21:44:54,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 17 states have internal predecessors, (50), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-30 21:44:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-01-30 21:44:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-30 21:44:54,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:54,361 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:54,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-30 21:44:54,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:54,577 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2088272914, now seen corresponding path program 3 times [2022-01-30 21:44:54,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:54,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864279400] [2022-01-30 21:44:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:54,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-30 21:44:54,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:54,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864279400] [2022-01-30 21:44:54,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864279400] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081262472] [2022-01-30 21:44:54,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 21:44:54,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:54,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-30 21:44:54,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-30 21:44:54,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 21:44:54,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-30 21:44:54,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:54,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-30 21:44:54,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-30 21:44:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-01-30 21:44:54,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 21:44:55,086 INFO L353 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-01-30 21:44:55,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2022-01-30 21:44:55,093 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-30 21:44:55,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-01-30 21:44:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-01-30 21:44:55,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081262472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 21:44:55,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 21:44:55,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2022-01-30 21:44:55,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116611867] [2022-01-30 21:44:55,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 21:44:55,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-30 21:44:55,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-30 21:44:55,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-01-30 21:44:55,127 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 21:44:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:55,451 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-01-30 21:44:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-30 21:44:55,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-01-30 21:44:55,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:55,452 INFO L225 Difference]: With dead ends: 95 [2022-01-30 21:44:55,452 INFO L226 Difference]: Without dead ends: 83 [2022-01-30 21:44:55,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2022-01-30 21:44:55,453 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 139 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:55,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 39 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-30 21:44:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-30 21:44:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2022-01-30 21:44:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 21:44:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-01-30 21:44:55,460 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 49 [2022-01-30 21:44:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:55,460 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-01-30 21:44:55,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 16 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 21:44:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-01-30 21:44:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-30 21:44:55,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:55,461 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:55,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-30 21:44:55,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:55,680 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:55,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1689234443, now seen corresponding path program 1 times [2022-01-30 21:44:55,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:55,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463235680] [2022-01-30 21:44:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:55,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-01-30 21:44:55,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463235680] [2022-01-30 21:44:55,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463235680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 21:44:55,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 21:44:55,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-30 21:44:55,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228627223] [2022-01-30 21:44:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 21:44:55,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-30 21:44:55,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-30 21:44:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-30 21:44:55,760 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 21:44:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:55,811 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-01-30 21:44:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-30 21:44:55,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-01-30 21:44:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:55,812 INFO L225 Difference]: With dead ends: 75 [2022-01-30 21:44:55,812 INFO L226 Difference]: Without dead ends: 64 [2022-01-30 21:44:55,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-30 21:44:55,813 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:55,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 26 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-30 21:44:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-30 21:44:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-01-30 21:44:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 55 states have internal predecessors, (57), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 21:44:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2022-01-30 21:44:55,818 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2022-01-30 21:44:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:55,818 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2022-01-30 21:44:55,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 21:44:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-01-30 21:44:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-30 21:44:55,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:55,819 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:55,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-30 21:44:55,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:55,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -788836233, now seen corresponding path program 1 times [2022-01-30 21:44:55,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114535931] [2022-01-30 21:44:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:55,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-30 21:44:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-01-30 21:44:55,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:55,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114535931] [2022-01-30 21:44:55,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114535931] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:55,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751854076] [2022-01-30 21:44:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:55,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:55,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:55,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:55,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-30 21:44:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:56,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-30 21:44:56,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-30 21:44:56,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 21:44:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-30 21:44:56,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751854076] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 21:44:56,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 21:44:56,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2022-01-30 21:44:56,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258628536] [2022-01-30 21:44:56,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 21:44:56,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-30 21:44:56,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:56,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-30 21:44:56,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=729, Unknown=0, NotChecked=0, Total=1056 [2022-01-30 21:44:56,854 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 33 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 31 states have internal predecessors, (87), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-30 21:44:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:44:57,544 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2022-01-30 21:44:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-30 21:44:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 31 states have internal predecessors, (87), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-01-30 21:44:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:44:57,545 INFO L225 Difference]: With dead ends: 152 [2022-01-30 21:44:57,546 INFO L226 Difference]: Without dead ends: 115 [2022-01-30 21:44:57,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=3006, Unknown=0, NotChecked=0, Total=4032 [2022-01-30 21:44:57,547 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 158 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 21:44:57,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 32 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-30 21:44:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-30 21:44:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 91. [2022-01-30 21:44:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 21:44:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2022-01-30 21:44:57,554 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 61 [2022-01-30 21:44:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:44:57,554 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2022-01-30 21:44:57,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.6363636363636362) internal successors, (87), 31 states have internal predecessors, (87), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-30 21:44:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2022-01-30 21:44:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-30 21:44:57,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:44:57,555 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:44:57,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-30 21:44:57,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:57,772 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:44:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:44:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -806074025, now seen corresponding path program 2 times [2022-01-30 21:44:57,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:44:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652130585] [2022-01-30 21:44:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:44:57,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:44:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:44:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:44:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-01-30 21:44:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:44:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2022-01-30 21:44:57,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:44:57,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652130585] [2022-01-30 21:44:57,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652130585] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:44:57,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241912982] [2022-01-30 21:44:57,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 21:44:57,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:44:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:44:57,886 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:44:57,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-30 21:44:58,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 21:44:58,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 21:44:58,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-30 21:44:58,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:44:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-30 21:44:58,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 21:44:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-30 21:44:59,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241912982] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 21:44:59,631 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 21:44:59,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 26, 26] total 58 [2022-01-30 21:44:59,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440144671] [2022-01-30 21:44:59,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 21:44:59,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-30 21:44:59,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:44:59,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-30 21:44:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1210, Invalid=2096, Unknown=0, NotChecked=0, Total=3306 [2022-01-30 21:44:59,634 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand has 58 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 56 states have internal predecessors, (138), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-30 21:45:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:45:01,213 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2022-01-30 21:45:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-30 21:45:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 56 states have internal predecessors, (138), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2022-01-30 21:45:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:45:01,215 INFO L225 Difference]: With dead ends: 211 [2022-01-30 21:45:01,215 INFO L226 Difference]: Without dead ends: 171 [2022-01-30 21:45:01,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3723, Invalid=9159, Unknown=0, NotChecked=0, Total=12882 [2022-01-30 21:45:01,218 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 241 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 21:45:01,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 40 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 21:45:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-01-30 21:45:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2022-01-30 21:45:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.0227272727272727) internal successors, (135), 133 states have internal predecessors, (135), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 21:45:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2022-01-30 21:45:01,231 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 88 [2022-01-30 21:45:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:45:01,231 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2022-01-30 21:45:01,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 56 states have internal predecessors, (138), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-30 21:45:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2022-01-30 21:45:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-30 21:45:01,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 21:45:01,238 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 21:45:01,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-30 21:45:01,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:45:01,458 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 21:45:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 21:45:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1992795729, now seen corresponding path program 3 times [2022-01-30 21:45:01,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 21:45:01,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433503828] [2022-01-30 21:45:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 21:45:01,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 21:45:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:45:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 21:45:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:45:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-30 21:45:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:45:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-30 21:45:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 21:45:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 2119 trivial. 0 not checked. [2022-01-30 21:45:01,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 21:45:01,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433503828] [2022-01-30 21:45:01,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433503828] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 21:45:01,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180560325] [2022-01-30 21:45:01,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 21:45:01,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 21:45:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 21:45:01,696 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 21:45:01,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-30 21:45:01,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-30 21:45:01,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 21:45:01,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-30 21:45:01,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 21:45:02,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 21:45:02,716 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 21:45:02,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2022-01-30 21:45:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 2065 trivial. 0 not checked. [2022-01-30 21:45:02,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 21:45:03,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-01-30 21:45:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2172 backedges. 2 proven. 107 refuted. 0 times theorem prover too weak. 2063 trivial. 0 not checked. [2022-01-30 21:45:04,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180560325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 21:45:04,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 21:45:04,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2022-01-30 21:45:04,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8367255] [2022-01-30 21:45:04,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 21:45:04,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-30 21:45:04,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 21:45:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-30 21:45:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-01-30 21:45:04,088 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 23 states have internal predecessors, (70), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-30 21:45:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 21:45:04,441 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-01-30 21:45:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-30 21:45:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 23 states have internal predecessors, (70), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 139 [2022-01-30 21:45:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 21:45:04,441 INFO L225 Difference]: With dead ends: 145 [2022-01-30 21:45:04,441 INFO L226 Difference]: Without dead ends: 0 [2022-01-30 21:45:04,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=1260, Unknown=0, NotChecked=0, Total=1560 [2022-01-30 21:45:04,442 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 21:45:04,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2022-01-30 21:45:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-30 21:45:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-30 21:45:04,443 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-01-30 21:45:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-30 21:45:04,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2022-01-30 21:45:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 21:45:04,443 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-30 21:45:04,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 23 states have internal predecessors, (70), 2 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-30 21:45:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-30 21:45:04,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-30 21:45:04,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-30 21:45:04,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-30 21:45:04,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-30 21:45:04,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-30 21:45:05,149 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 14) no Hoare annotation was computed. [2022-01-30 21:45:05,149 INFO L858 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-01-30 21:45:05,149 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 14) no Hoare annotation was computed. [2022-01-30 21:45:05,149 INFO L858 garLoopResultBuilder]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2022-01-30 21:45:05,149 INFO L854 garLoopResultBuilder]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and (exists ((v_init_~i~0_184 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* v_init_~i~0_184 4) |init_#in~a.offset|)) 0)) (< v_init_~i~0_184 init_~size) (<= init_~i~0 (+ v_init_~i~0_184 1)))) .cse0 .cse1 .cse2) (and (<= init_~i~0 0) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) .cse0 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) .cse1 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse2 (= |old(#valid)| |#valid|)))) [2022-01-30 21:45:05,149 INFO L858 garLoopResultBuilder]: For program point L23-4(lines 20 27) no Hoare annotation was computed. [2022-01-30 21:45:05,149 INFO L854 garLoopResultBuilder]: At program point initENTRY(lines 20 27) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-01-30 21:45:05,149 INFO L858 garLoopResultBuilder]: For program point initEXIT(lines 20 27) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L854 garLoopResultBuilder]: At program point L35-3(lines 35 41) the Hoare annotation is: (let ((.cse0 (= |main_~#a~0.offset| 0)) (.cse1 (= main_~flag~0 0)) (.cse2 (forall ((main_~i~1 Int)) (or (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* main_~i~1 4))))) (not (< main_~i~1 100000)) (< main_~i~1 99999))))) (or (<= 1 main_~flag~0) (and .cse0 (< main_~i~1 100000) .cse1 (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) 0) .cse2 (= (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|) 0)) (and .cse0 .cse1 .cse2 (= main_~i~1 0)))) [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 28 48) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 28 48) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L854 garLoopResultBuilder]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 main_~flag~0) [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L854 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (= |main_~#a~0.offset| 0) (= main_~flag~0 0)) [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L34-1(line 34) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 28 48) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-01-30 21:45:05,150 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: false [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 40) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-30 21:45:05,150 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-30 21:45:05,150 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-30 21:45:05,150 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-30 21:45:05,151 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-30 21:45:05,151 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 15) the Hoare annotation is: true [2022-01-30 21:45:05,151 INFO L858 garLoopResultBuilder]: For program point L15-1(line 15) no Hoare annotation was computed. [2022-01-30 21:45:05,151 INFO L858 garLoopResultBuilder]: For program point L15-3(line 15) no Hoare annotation was computed. [2022-01-30 21:45:05,151 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 15) no Hoare annotation was computed. [2022-01-30 21:45:05,151 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-01-30 21:45:05,153 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2022-01-30 21:45:05,154 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-30 21:45:05,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,160 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,160 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,161 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,166 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,175 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,175 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,175 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,175 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,176 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,176 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,177 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 09:45:05 BoogieIcfgContainer [2022-01-30 21:45:05,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-30 21:45:05,187 INFO L158 Benchmark]: Toolchain (without parser) took 14369.64ms. Allocated memory was 207.6MB in the beginning and 396.4MB in the end (delta: 188.7MB). Free memory was 153.8MB in the beginning and 368.2MB in the end (delta: -214.4MB). Peak memory consumption was 217.4MB. Max. memory is 8.0GB. [2022-01-30 21:45:05,187 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 207.6MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-30 21:45:05,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.66ms. Allocated memory was 207.6MB in the beginning and 274.7MB in the end (delta: 67.1MB). Free memory was 153.5MB in the beginning and 248.1MB in the end (delta: -94.6MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-01-30 21:45:05,188 INFO L158 Benchmark]: Boogie Preprocessor took 46.86ms. Allocated memory is still 274.7MB. Free memory was 248.1MB in the beginning and 246.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-30 21:45:05,188 INFO L158 Benchmark]: RCFGBuilder took 240.00ms. Allocated memory is still 274.7MB. Free memory was 246.6MB in the beginning and 234.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-30 21:45:05,188 INFO L158 Benchmark]: TraceAbstraction took 13834.01ms. Allocated memory was 274.7MB in the beginning and 396.4MB in the end (delta: 121.6MB). Free memory was 234.0MB in the beginning and 368.2MB in the end (delta: -134.2MB). Peak memory consumption was 230.8MB. Max. memory is 8.0GB. [2022-01-30 21:45:05,191 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.15ms. Allocated memory is still 207.6MB. Free memory is still 169.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.66ms. Allocated memory was 207.6MB in the beginning and 274.7MB in the end (delta: 67.1MB). Free memory was 153.5MB in the beginning and 248.1MB in the end (delta: -94.6MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.86ms. Allocated memory is still 274.7MB. Free memory was 248.1MB in the beginning and 246.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 240.00ms. Allocated memory is still 274.7MB. Free memory was 246.6MB in the beginning and 234.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13834.01ms. Allocated memory was 274.7MB in the beginning and 396.4MB in the end (delta: 121.6MB). Free memory was 234.0MB in the beginning and 368.2MB in the end (delta: -134.2MB). Peak memory consumption was 230.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 15]: 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 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 11, TraceHistogramMax: 46, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 848 mSDsluCounter, 447 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 515 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1790 IncrementalHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 515 mSolverCounterUnsat, 242 mSDtfsCounter, 1790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1104 GetRequests, 781 SyntacticMatches, 3 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=10, InterpolantAutomatonStates: 191, 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, 11 MinimizatonAttempts, 115 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 24 PreInvPairs, 80 NumberOfFragments, 194 HoareAnnotationTreeSize, 24 FomulaSimplifications, 69 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 2178 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 979 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1350 ConstructedInterpolants, 41 QuantifiedInterpolants, 7952 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 7450/9002 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: 35]: Loop Invariant [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,200 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2022-01-30 21:45:05,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] Derived loop invariant: (1 <= flag || (((((a == 0 && i < 100000) && flag == 0) && #memory_$Pointer$[a][a] == 0) && (forall main_~i~1 : int :: (!(0 == #memory_$Pointer$[a][a + main_~i~1 * 4]) || !(main_~i~1 < 100000)) || main_~i~1 < 99999)) && #memory_$Pointer$[a][a] == 0)) || (((a == 0 && flag == 0) && (forall main_~i~1 : int :: (!(0 == #memory_$Pointer$[a][a + main_~i~1 * 4]) || !(main_~i~1 < 100000)) || main_~i~1 < 99999)) && i == 0) - InvariantResult [Line: 23]: Loop Invariant [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,202 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,206 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_184,QUANTIFIED] [2022-01-30 21:45:05,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-30 21:45:05,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-30 21:45:05,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((\exists v_init_~i~0_184 : int :: (!(#memory_$Pointer$[a][v_init_~i~0_184 * 4 + a] == 0) && v_init_~i~0_184 < size) && i <= v_init_~i~0_184 + 1) && a == a) && \old(size) == size) && a == a) || ((((((((i <= 0 && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && a == a) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(size) == size) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && a == a) && \old(\valid) == \valid) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag RESULT: Ultimate proved your program to be correct! [2022-01-30 21:45:05,229 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...