./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/xor5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 10:28:37,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 10:28:37,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 10:28:37,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 10:28:37,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 10:28:37,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 10:28:37,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 10:28:37,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 10:28:37,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 10:28:37,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 10:28:37,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 10:28:37,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 10:28:37,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 10:28:37,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 10:28:37,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 10:28:37,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 10:28:37,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 10:28:37,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 10:28:37,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 10:28:37,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 10:28:37,364 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 10:28:37,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 10:28:37,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 10:28:37,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 10:28:37,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 10:28:37,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 10:28:37,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 10:28:37,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 10:28:37,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 10:28:37,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 10:28:37,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 10:28:37,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 10:28:37,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 10:28:37,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 10:28:37,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 10:28:37,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 10:28:37,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 10:28:37,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 10:28:37,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 10:28:37,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 10:28:37,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 10:28:37,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 10:28:37,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 10:28:37,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 10:28:37,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 10:28:37,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 10:28:37,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 10:28:37,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 10:28:37,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 10:28:37,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 10:28:37,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 10:28:37,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 10:28:37,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 10:28:37,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 10:28:37,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 10:28:37,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 10:28:37,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 10:28:37,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 10:28:37,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 10:28:37,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 10:28:37,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 10:28:37,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:28:37,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 10:28:37,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 10:28:37,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 10:28:37,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 10:28:37,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 10:28:37,406 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 10:28:37,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 10:28:37,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 10:28:37,406 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2022-07-13 10:28:37,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:28:37,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:28:37,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:28:37,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:28:37,594 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:28:37,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2022-07-13 10:28:37,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544d64b6d/490c78ccaadc4bde948df714d9e2bc31/FLAG310eed8f0 [2022-07-13 10:28:38,036 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:28:38,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2022-07-13 10:28:38,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544d64b6d/490c78ccaadc4bde948df714d9e2bc31/FLAG310eed8f0 [2022-07-13 10:28:38,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544d64b6d/490c78ccaadc4bde948df714d9e2bc31 [2022-07-13 10:28:38,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:28:38,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:28:38,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:28:38,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:28:38,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:28:38,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68adcca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38, skipping insertion in model container [2022-07-13 10:28:38,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:28:38,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:28:38,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-13 10:28:38,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:28:38,254 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:28:38,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-13 10:28:38,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:28:38,304 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:28:38,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38 WrapperNode [2022-07-13 10:28:38,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:28:38,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:28:38,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:28:38,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:28:38,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,345 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-13 10:28:38,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:28:38,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:28:38,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:28:38,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:28:38,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:28:38,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:28:38,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:28:38,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:28:38,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (1/1) ... [2022-07-13 10:28:38,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:28:38,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:28:38,412 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-07-13 10:28:38,435 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-07-13 10:28:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:28:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 10:28:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:28:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 10:28:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:28:38,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:28:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 10:28:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-07-13 10:28:38,458 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-07-13 10:28:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:28:38,530 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:28:38,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:28:38,683 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:28:38,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:28:38,706 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:28:38,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:38 BoogieIcfgContainer [2022-07-13 10:28:38,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:28:38,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:28:38,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:28:38,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:28:38,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:28:38" (1/3) ... [2022-07-13 10:28:38,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5a53bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:28:38, skipping insertion in model container [2022-07-13 10:28:38,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:38" (2/3) ... [2022-07-13 10:28:38,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5a53bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:28:38, skipping insertion in model container [2022-07-13 10:28:38,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:38" (3/3) ... [2022-07-13 10:28:38,729 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2022-07-13 10:28:38,738 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:28:38,739 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:28:38,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:28:38,810 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@97a8571, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18eb02b3 [2022-07-13 10:28:38,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:28:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:28:38,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:38,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:38,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2022-07-13 10:28:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:28:38,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60043519] [2022-07-13 10:28:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:28:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:38,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 10:28:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:38,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 10:28:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:38,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 10:28:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:28:38,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60043519] [2022-07-13 10:28:38,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60043519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:28:38,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:28:38,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:28:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675537545] [2022-07-13 10:28:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:28:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:28:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:28:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:28:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:28:39,005 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:39,020 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-07-13 10:28:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:28:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-13 10:28:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:39,027 INFO L225 Difference]: With dead ends: 51 [2022-07-13 10:28:39,027 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 10:28:39,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:28:39,033 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:39,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:28:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 10:28:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 10:28:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 10:28:39,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-07-13 10:28:39,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:39,061 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 10:28:39,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 10:28:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:28:39,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:39,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:39,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 10:28:39,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2022-07-13 10:28:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:28:39,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230633679] [2022-07-13 10:28:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:28:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 10:28:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 10:28:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 10:28:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:28:39,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230633679] [2022-07-13 10:28:39,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230633679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:28:39,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:28:39,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:28:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305896777] [2022-07-13 10:28:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:28:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:28:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:28:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:28:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:28:39,194 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:39,221 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-13 10:28:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:28:39,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-13 10:28:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:39,223 INFO L225 Difference]: With dead ends: 43 [2022-07-13 10:28:39,223 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 10:28:39,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:28:39,225 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:39,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:28:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 10:28:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-13 10:28:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-13 10:28:39,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-13 10:28:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:39,236 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-13 10:28:39,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-13 10:28:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 10:28:39,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:39,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 10:28:39,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2022-07-13 10:28:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:28:39,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080929819] [2022-07-13 10:28:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:28:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 10:28:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 10:28:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 10:28:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 10:28:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:28:39,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080929819] [2022-07-13 10:28:39,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080929819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:28:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639438336] [2022-07-13 10:28:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:28:39,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:28:39,311 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-07-13 10:28:39,339 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-07-13 10:28:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:28:39,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:39,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:28:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:39,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639438336] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:28:39,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 10:28:39,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-13 10:28:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200248396] [2022-07-13 10:28:39,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 10:28:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 10:28:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:28:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 10:28:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 10:28:39,524 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 10:28:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:39,615 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-13 10:28:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 10:28:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2022-07-13 10:28:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:39,616 INFO L225 Difference]: With dead ends: 47 [2022-07-13 10:28:39,617 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 10:28:39,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-13 10:28:39,618 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:39,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:28:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 10:28:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-13 10:28:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-13 10:28:39,622 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2022-07-13 10:28:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:39,623 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-13 10:28:39,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 10:28:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-13 10:28:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 10:28:39,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:39,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:39,643 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-07-13 10:28:39,828 WARN L477 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-07-13 10:28:39,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:39,829 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2022-07-13 10:28:39,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:28:39,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158713778] [2022-07-13 10:28:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:39,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:28:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 10:28:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 10:28:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 10:28:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:28:39,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 10:28:39,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158713778] [2022-07-13 10:28:39,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158713778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 10:28:39,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858035200] [2022-07-13 10:28:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:39,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 10:28:39,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:28:39,968 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-07-13 10:28:39,969 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-07-13 10:28:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:40,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:28:40,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 10:28:40,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:28:40,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858035200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:28:40,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 10:28:40,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-13 10:28:40,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481428887] [2022-07-13 10:28:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:28:40,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:28:40,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 10:28:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:28:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:28:40,096 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 10:28:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:40,137 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-13 10:28:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:28:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-13 10:28:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:40,140 INFO L225 Difference]: With dead ends: 42 [2022-07-13 10:28:40,142 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 10:28:40,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:28:40,146 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:40,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:28:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 10:28:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-13 10:28:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 10:28:40,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-07-13 10:28:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:40,151 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 10:28:40,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 10:28:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 10:28:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 10:28:40,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:40,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:40,170 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-07-13 10:28:40,360 WARN L477 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-07-13 10:28:40,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:40,361 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2022-07-13 10:28:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 10:28:40,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960832758] [2022-07-13 10:28:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:40,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 10:28:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 10:28:40,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 10:28:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 10:28:40,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 10:28:40,525 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 10:28:40,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 10:28:40,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 10:28:40,530 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-13 10:28:40,532 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 10:28:40,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:28:40 BoogieIcfgContainer [2022-07-13 10:28:40,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 10:28:40,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 10:28:40,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 10:28:40,566 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 10:28:40,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:38" (3/4) ... [2022-07-13 10:28:40,568 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 10:28:40,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 10:28:40,569 INFO L158 Benchmark]: Toolchain (without parser) took 2517.21ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 58.2MB in the beginning and 70.9MB in the end (delta: -12.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-13 10:28:40,569 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 74.4MB in the beginning and 74.3MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 10:28:40,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.32ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 70.4MB in the end (delta: -12.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-13 10:28:40,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.00ms. Allocated memory is still 94.4MB. Free memory was 70.2MB in the beginning and 68.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 10:28:40,570 INFO L158 Benchmark]: Boogie Preprocessor took 33.09ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 10:28:40,570 INFO L158 Benchmark]: RCFGBuilder took 329.15ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 56.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 10:28:40,571 INFO L158 Benchmark]: TraceAbstraction took 1855.12ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 71.5MB in the end (delta: -16.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2022-07-13 10:28:40,571 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 70.9MB in the end (delta: 674.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 10:28:40,572 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.19ms. Allocated memory is still 94.4MB. Free memory was 74.4MB in the beginning and 74.3MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.32ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 70.4MB in the end (delta: -12.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.00ms. Allocated memory is still 94.4MB. Free memory was 70.2MB in the beginning and 68.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.09ms. Allocated memory is still 94.4MB. Free memory was 68.7MB in the beginning and 67.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 329.15ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 56.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1855.12ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 71.5MB in the end (delta: -16.0MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 113.2MB. Free memory was 71.5MB in the beginning and 70.9MB in the end (delta: 674.2kB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXOr at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}] [L45] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-1, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, res=0, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, res=0, x={9:0}, x={9:0}] [L27] return res; VAL [\result=0, i=2, N=2, res=0, x={9:0}, x={9:0}] [L45] RET, EXPR xor(x) VAL [i=2, N=2, x={9:0}, xor(x)=0] [L45] ret = xor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=0, temp=-1, x={9:0}] [L48] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=1, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, res=1, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, res=1, x={9:0}, x={9:0}] [L27] return res; VAL [\result=1, i=2, N=2, res=1, x={9:0}, x={9:0}] [L48] RET, EXPR xor(x) VAL [i=2, N=2, ret=0, temp=-1, x={9:0}, xor(x)=1] [L48] ret2 = xor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=0, ret2=1, temp=1, x={9:0}] [L50] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2022-07-13 10:28:42,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 10:28:42,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 10:28:42,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 10:28:42,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 10:28:42,689 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 10:28:42,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2022-07-13 10:28:42,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60b817d6/89a2468a777a46c5bf264a70b7f96c8a/FLAG02c72000a [2022-07-13 10:28:43,056 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 10:28:43,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2022-07-13 10:28:43,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60b817d6/89a2468a777a46c5bf264a70b7f96c8a/FLAG02c72000a [2022-07-13 10:28:43,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60b817d6/89a2468a777a46c5bf264a70b7f96c8a [2022-07-13 10:28:43,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 10:28:43,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 10:28:43,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 10:28:43,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 10:28:43,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 10:28:43,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9cba55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43, skipping insertion in model container [2022-07-13 10:28:43,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 10:28:43,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 10:28:43,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-13 10:28:43,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:28:43,591 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 10:28:43,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-13 10:28:43,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 10:28:43,680 INFO L208 MainTranslator]: Completed translation [2022-07-13 10:28:43,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43 WrapperNode [2022-07-13 10:28:43,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 10:28:43,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 10:28:43,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 10:28:43,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 10:28:43,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,719 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2022-07-13 10:28:43,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 10:28:43,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 10:28:43,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 10:28:43,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 10:28:43,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 10:28:43,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 10:28:43,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 10:28:43,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 10:28:43,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (1/1) ... [2022-07-13 10:28:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 10:28:43,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 10:28:43,786 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-07-13 10:28:43,805 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-07-13 10:28:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 10:28:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 10:28:43,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 10:28:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 10:28:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 10:28:43,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 10:28:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-07-13 10:28:43,818 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-07-13 10:28:43,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 10:28:43,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 10:28:43,899 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 10:28:43,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 10:28:44,028 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 10:28:44,047 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 10:28:44,047 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 10:28:44,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:44 BoogieIcfgContainer [2022-07-13 10:28:44,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 10:28:44,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 10:28:44,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 10:28:44,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 10:28:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:28:43" (1/3) ... [2022-07-13 10:28:44,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02f832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:28:44, skipping insertion in model container [2022-07-13 10:28:44,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:28:43" (2/3) ... [2022-07-13 10:28:44,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02f832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:28:44, skipping insertion in model container [2022-07-13 10:28:44,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:28:44" (3/3) ... [2022-07-13 10:28:44,054 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2022-07-13 10:28:44,063 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 10:28:44,064 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 10:28:44,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 10:28:44,118 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1197275e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a564b68 [2022-07-13 10:28:44,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 10:28:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:28:44,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:44,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:44,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2022-07-13 10:28:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:28:44,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383994303] [2022-07-13 10:28:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:44,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:28:44,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:28:44,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:28:44,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 10:28:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:44,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 10:28:44,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 10:28:44,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:28:44,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:28:44,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383994303] [2022-07-13 10:28:44,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383994303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:28:44,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:28:44,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 10:28:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958524940] [2022-07-13 10:28:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:28:44,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 10:28:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:28:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 10:28:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:28:44,297 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:44,312 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-07-13 10:28:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 10:28:44,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-13 10:28:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:44,318 INFO L225 Difference]: With dead ends: 51 [2022-07-13 10:28:44,319 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 10:28:44,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 10:28:44,323 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:44,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:28:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 10:28:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 10:28:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 10:28:44,347 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-07-13 10:28:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:44,348 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 10:28:44,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 10:28:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 10:28:44,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:44,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:44,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 10:28:44,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:28:44,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2022-07-13 10:28:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:28:44,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021860245] [2022-07-13 10:28:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:44,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:28:44,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:28:44,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:28:44,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 10:28:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:44,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:28:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:44,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:28:44,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:28:44,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021860245] [2022-07-13 10:28:44,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021860245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:28:44,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:28:44,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 10:28:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616771056] [2022-07-13 10:28:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:28:44,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 10:28:44,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:28:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 10:28:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:28:44,676 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:44,701 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-13 10:28:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 10:28:44,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-13 10:28:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:44,702 INFO L225 Difference]: With dead ends: 43 [2022-07-13 10:28:44,703 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 10:28:44,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 10:28:44,704 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:44,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 10:28:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 10:28:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-13 10:28:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-13 10:28:44,709 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-13 10:28:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:44,709 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-13 10:28:44,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-13 10:28:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 10:28:44,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:44,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:44,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 10:28:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:28:44,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2022-07-13 10:28:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:28:44,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485051418] [2022-07-13 10:28:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:28:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:28:44,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:28:44,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 10:28:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:44,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 10:28:44,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:45,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:28:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 10:28:45,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:28:45,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485051418] [2022-07-13 10:28:45,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485051418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:28:45,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:28:45,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-13 10:28:45,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968528824] [2022-07-13 10:28:45,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:28:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 10:28:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:28:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 10:28:45,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:28:45,075 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 10:28:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:45,152 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-13 10:28:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 10:28:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2022-07-13 10:28:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:45,154 INFO L225 Difference]: With dead ends: 45 [2022-07-13 10:28:45,154 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 10:28:45,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 10:28:45,155 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:28:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 10:28:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-13 10:28:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-13 10:28:45,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2022-07-13 10:28:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:45,160 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-13 10:28:45,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 10:28:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-13 10:28:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 10:28:45,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:45,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:45,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 10:28:45,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:28:45,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1821751230, now seen corresponding path program 2 times [2022-07-13 10:28:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:28:45,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535650358] [2022-07-13 10:28:45,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:28:45,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:28:45,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:28:45,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:28:45,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 10:28:45,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 10:28:45,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:28:45,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 10:28:45,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 10:28:45,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 10:28:45,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:28:45,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535650358] [2022-07-13 10:28:45,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535650358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 10:28:45,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 10:28:45,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 10:28:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281013148] [2022-07-13 10:28:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 10:28:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 10:28:45,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:28:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 10:28:45,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:28:45,505 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:45,563 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-13 10:28:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 10:28:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-07-13 10:28:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:45,566 INFO L225 Difference]: With dead ends: 45 [2022-07-13 10:28:45,567 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 10:28:45,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 10:28:45,571 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:45,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:28:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 10:28:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-13 10:28:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-13 10:28:45,581 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-07-13 10:28:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:45,582 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-13 10:28:45,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 10:28:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-13 10:28:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 10:28:45,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:45,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:45,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 10:28:45,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:28:45,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:45,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2022-07-13 10:28:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:28:45,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796932420] [2022-07-13 10:28:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:45,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:28:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:28:45,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:28:45,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 10:28:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:45,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 10:28:45,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 10:28:45,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:28:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 10:28:46,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:28:46,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796932420] [2022-07-13 10:28:46,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796932420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:28:46,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:28:46,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-13 10:28:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958932991] [2022-07-13 10:28:46,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:28:46,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 10:28:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:28:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 10:28:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-13 10:28:46,152 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 10:28:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:28:46,358 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-07-13 10:28:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 10:28:46,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-07-13 10:28:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:28:46,359 INFO L225 Difference]: With dead ends: 65 [2022-07-13 10:28:46,360 INFO L226 Difference]: Without dead ends: 52 [2022-07-13 10:28:46,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2022-07-13 10:28:46,360 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 10:28:46,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 10:28:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-13 10:28:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-07-13 10:28:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:28:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 10:28:46,366 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-07-13 10:28:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:28:46,367 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 10:28:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 10:28:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 10:28:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 10:28:46,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:28:46,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:28:46,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 10:28:46,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:28:46,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:28:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:28:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2022-07-13 10:28:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:28:46,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495707750] [2022-07-13 10:28:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 10:28:46,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:28:46,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:28:46,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:28:46,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 10:28:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 10:28:46,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 10:28:46,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:28:47,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:28:47,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:28:47,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2022-07-13 10:28:47,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:28:47,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:28:47,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2022-07-13 10:28:47,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:28:47,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:28:47,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:28:47,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2022-07-13 10:28:47,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:28:47,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2022-07-13 10:28:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 10:28:47,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:28:53,445 INFO L390 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 111 treesize of output 87 [2022-07-13 10:28:53,458 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 10:28:53,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 112 treesize of output 88 [2022-07-13 10:29:01,150 INFO L390 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 111 treesize of output 87 [2022-07-13 10:29:01,154 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 10:29:01,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 112 treesize of output 1 [2022-07-13 10:29:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 14 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 10:29:01,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:29:01,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495707750] [2022-07-13 10:29:01,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495707750] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:29:01,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:29:01,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-07-13 10:29:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324957058] [2022-07-13 10:29:01,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:29:01,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 10:29:01,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:29:01,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 10:29:01,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1455, Unknown=2, NotChecked=0, Total=1640 [2022-07-13 10:29:01,514 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 10:29:03,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 10:29:08,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 10:29:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:29:15,730 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-07-13 10:29:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 10:29:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-07-13 10:29:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:29:15,734 INFO L225 Difference]: With dead ends: 84 [2022-07-13 10:29:15,735 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 10:29:15,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=391, Invalid=2796, Unknown=5, NotChecked=0, Total=3192 [2022-07-13 10:29:15,737 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-13 10:29:15,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 207 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 774 Invalid, 0 Unknown, 47 Unchecked, 5.5s Time] [2022-07-13 10:29:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 10:29:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2022-07-13 10:29:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-13 10:29:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-13 10:29:15,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2022-07-13 10:29:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:29:15,769 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-13 10:29:15,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 10:29:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-13 10:29:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 10:29:15,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:29:15,772 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:29:15,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 10:29:15,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:29:15,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:29:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:29:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash 88846840, now seen corresponding path program 2 times [2022-07-13 10:29:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:29:15,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613823426] [2022-07-13 10:29:15,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 10:29:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:29:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:29:15,975 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:29:15,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 10:29:16,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 10:29:16,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:29:16,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 10:29:16,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:29:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:29:16,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:29:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:29:16,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:29:16,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613823426] [2022-07-13 10:29:16,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613823426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:29:16,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:29:16,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2022-07-13 10:29:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628845997] [2022-07-13 10:29:16,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:29:16,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 10:29:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:29:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 10:29:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:29:16,511 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 10:29:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:29:16,931 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2022-07-13 10:29:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 10:29:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-07-13 10:29:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:29:16,932 INFO L225 Difference]: With dead ends: 104 [2022-07-13 10:29:16,932 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 10:29:16,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-13 10:29:16,933 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 10:29:16,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 173 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 10:29:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 10:29:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2022-07-13 10:29:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 10:29:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-07-13 10:29:16,941 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-07-13 10:29:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:29:16,941 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-13 10:29:16,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 10:29:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-07-13 10:29:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 10:29:16,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:29:16,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:29:16,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 10:29:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:29:17,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:29:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:29:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1417469948, now seen corresponding path program 3 times [2022-07-13 10:29:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:29:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882025433] [2022-07-13 10:29:17,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 10:29:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:29:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:29:17,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:29:17,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 10:29:17,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 10:29:17,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:29:17,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:29:17,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:29:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:29:17,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:29:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:29:17,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:29:17,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882025433] [2022-07-13 10:29:17,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882025433] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:29:17,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:29:17,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2022-07-13 10:29:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366106006] [2022-07-13 10:29:17,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:29:17,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 10:29:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:29:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 10:29:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-13 10:29:17,496 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 10:29:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:29:17,740 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-07-13 10:29:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 10:29:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-07-13 10:29:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:29:17,742 INFO L225 Difference]: With dead ends: 77 [2022-07-13 10:29:17,742 INFO L226 Difference]: Without dead ends: 58 [2022-07-13 10:29:17,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:29:17,742 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:29:17,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 113 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 10:29:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-13 10:29:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-13 10:29:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-13 10:29:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-13 10:29:17,748 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-07-13 10:29:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:29:17,749 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-13 10:29:17,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 10:29:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-13 10:29:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 10:29:17,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:29:17,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:29:17,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 10:29:17,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:29:17,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:29:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:29:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2102516822, now seen corresponding path program 4 times [2022-07-13 10:29:17,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:29:17,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440639776] [2022-07-13 10:29:17,959 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 10:29:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:29:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:29:17,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:29:17,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 10:29:18,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 10:29:18,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:29:18,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 10:29:18,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:29:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 10:29:18,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:29:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 10:29:18,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:29:18,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440639776] [2022-07-13 10:29:18,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440639776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:29:18,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:29:18,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 10:29:18,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128981548] [2022-07-13 10:29:18,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:29:18,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 10:29:18,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:29:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 10:29:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-13 10:29:18,323 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 10:29:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:29:18,516 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-13 10:29:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 10:29:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2022-07-13 10:29:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:29:18,518 INFO L225 Difference]: With dead ends: 64 [2022-07-13 10:29:18,518 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 10:29:18,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-13 10:29:18,520 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 10:29:18,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 10:29:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 10:29:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-13 10:29:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 10:29:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-13 10:29:18,530 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2022-07-13 10:29:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:29:18,530 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-13 10:29:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 10:29:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-13 10:29:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 10:29:18,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:29:18,531 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:29:18,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 10:29:18,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:29:18,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:29:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:29:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash -457868326, now seen corresponding path program 5 times [2022-07-13 10:29:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:29:18,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437344669] [2022-07-13 10:29:18,739 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 10:29:18,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:29:18,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:29:18,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:29:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 10:29:18,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-13 10:29:18,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:29:18,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 10:29:18,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:29:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 10:29:18,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:29:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 10:29:19,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 10:29:19,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437344669] [2022-07-13 10:29:19,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437344669] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 10:29:19,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 10:29:19,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2022-07-13 10:29:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466270720] [2022-07-13 10:29:19,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 10:29:19,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 10:29:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 10:29:19,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 10:29:19,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-13 10:29:19,205 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 10:29:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 10:29:19,716 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-13 10:29:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 10:29:19,716 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-13 10:29:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 10:29:19,717 INFO L225 Difference]: With dead ends: 101 [2022-07-13 10:29:19,717 INFO L226 Difference]: Without dead ends: 82 [2022-07-13 10:29:19,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2022-07-13 10:29:19,718 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 117 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 10:29:19,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 151 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 10:29:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-13 10:29:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2022-07-13 10:29:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 10:29:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-07-13 10:29:19,724 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2022-07-13 10:29:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 10:29:19,725 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-07-13 10:29:19,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 10:29:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-07-13 10:29:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 10:29:19,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 10:29:19,726 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 10:29:19,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 10:29:19,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 10:29:19,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 10:29:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 10:29:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -376141416, now seen corresponding path program 6 times [2022-07-13 10:29:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 10:29:19,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114193647] [2022-07-13 10:29:19,933 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 10:29:19,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 10:29:19,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 10:29:19,934 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 10:29:19,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 10:29:20,138 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-13 10:29:20,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 10:29:20,145 WARN L261 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-13 10:29:20,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 10:29:20,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:29:20,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2022-07-13 10:29:20,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:29:20,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:20,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:29:20,980 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-13 10:29:20,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2022-07-13 10:29:21,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:21,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:21,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:21,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:29:21,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2022-07-13 10:29:21,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:21,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 10:29:21,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:21,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 10:29:21,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:29:21,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 63 [2022-07-13 10:29:21,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 10:29:21,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 34 [2022-07-13 10:29:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 10:29:21,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 10:29:36,466 INFO L390 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 201 treesize of output 159 [2022-07-13 10:29:36,482 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-13 10:29:36,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7548080 treesize of output 4871344 [2022-07-13 10:32:47,034 WARN L233 SmtUtils]: Spent 3.18m on a formula simplification. DAG size of input: 376 DAG size of output: 376 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)