./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/nla-digbench-scaling/egcd2-ll_valuebound10.c -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 e42acecc60a22c4c35e0f65ff603b488451c653e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 05:58:21,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 05:58:21,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 05:58:21,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 05:58:21,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 05:58:21,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 05:58:21,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 05:58:21,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 05:58:21,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 05:58:21,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 05:58:21,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 05:58:21,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 05:58:21,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 05:58:21,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 05:58:21,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 05:58:21,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 05:58:21,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 05:58:21,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 05:58:21,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 05:58:21,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 05:58:21,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 05:58:21,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 05:58:21,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 05:58:21,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 05:58:21,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 05:58:21,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 05:58:21,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 05:58:21,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 05:58:21,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 05:58:21,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 05:58:21,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 05:58:21,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 05:58:21,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 05:58:21,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 05:58:21,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 05:58:21,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 05:58:21,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 05:58:21,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 05:58:21,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 05:58:21,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 05:58:21,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 05:58:21,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 05:58:21,493 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 05:58:21,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 05:58:21,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 05:58:21,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 05:58:21,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 05:58:21,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 05:58:21,496 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 05:58:21,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 05:58:21,496 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 05:58:21,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 05:58:21,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 05:58:21,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 05:58:21,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 05:58:21,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 05:58:21,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 05:58:21,498 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 05:58:21,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 05:58:21,498 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 05:58:21,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 05:58:21,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 05:58:21,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 05:58:21,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 05:58:21,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:58:21,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 05:58:21,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 05:58:21,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 05:58:21,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 05:58:21,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 05:58:21,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 05:58:21,500 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 05:58:21,500 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 -> e42acecc60a22c4c35e0f65ff603b488451c653e [2021-08-26 05:58:21,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 05:58:21,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 05:58:21,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 05:58:21,792 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 05:58:21,792 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 05:58:21,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound10.c [2021-08-26 05:58:21,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a05877ae/9dd0ebba8aa24bf9a5b4fe8a0a6b8d6a/FLAGc47fdc936 [2021-08-26 05:58:22,215 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 05:58:22,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound10.c [2021-08-26 05:58:22,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a05877ae/9dd0ebba8aa24bf9a5b4fe8a0a6b8d6a/FLAGc47fdc936 [2021-08-26 05:58:22,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a05877ae/9dd0ebba8aa24bf9a5b4fe8a0a6b8d6a [2021-08-26 05:58:22,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 05:58:22,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 05:58:22,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 05:58:22,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 05:58:22,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 05:58:22,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e79f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22, skipping insertion in model container [2021-08-26 05:58:22,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 05:58:22,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 05:58:22,373 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound10.c[490,503] [2021-08-26 05:58:22,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:58:22,404 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 05:58:22,417 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_valuebound10.c[490,503] [2021-08-26 05:58:22,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 05:58:22,456 INFO L208 MainTranslator]: Completed translation [2021-08-26 05:58:22,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22 WrapperNode [2021-08-26 05:58:22,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 05:58:22,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 05:58:22,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 05:58:22,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 05:58:22,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 05:58:22,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 05:58:22,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 05:58:22,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 05:58:22,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 05:58:22,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 05:58:22,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 05:58:22,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 05:58:22,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (1/1) ... [2021-08-26 05:58:22,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 05:58:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:22,556 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) [2021-08-26 05:58:22,562 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 [2021-08-26 05:58:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 05:58:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 05:58:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 05:58:22,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 05:58:22,924 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 05:58:22,925 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-26 05:58:22,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:58:22 BoogieIcfgContainer [2021-08-26 05:58:22,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 05:58:22,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 05:58:22,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 05:58:22,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 05:58:22,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:58:22" (1/3) ... [2021-08-26 05:58:22,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c223c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:58:22, skipping insertion in model container [2021-08-26 05:58:22,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:58:22" (2/3) ... [2021-08-26 05:58:22,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c223c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:58:22, skipping insertion in model container [2021-08-26 05:58:22,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:58:22" (3/3) ... [2021-08-26 05:58:22,930 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound10.c [2021-08-26 05:58:22,933 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 05:58:22,936 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-26 05:58:22,972 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 05:58:22,978 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 05:58:22,979 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-26 05:58:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 38 states have (on average 1.631578947368421) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 05:58:22,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:22,995 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:22,996 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:22,999 INFO L82 PathProgramCache]: Analyzing trace with hash 823104699, now seen corresponding path program 1 times [2021-08-26 05:58:23,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:23,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118980788] [2021-08-26 05:58:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:23,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:23,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:23,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118980788] [2021-08-26 05:58:23,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118980788] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:23,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:23,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 05:58:23,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266224836] [2021-08-26 05:58:23,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 05:58:23,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 05:58:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:58:23,107 INFO L87 Difference]: Start difference. First operand has 45 states, 38 states have (on average 1.631578947368421) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:23,117 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2021-08-26 05:58:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 05:58:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 05:58:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:23,122 INFO L225 Difference]: With dead ends: 87 [2021-08-26 05:58:23,123 INFO L226 Difference]: Without dead ends: 41 [2021-08-26 05:58:23,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 05:58:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-08-26 05:58:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-08-26 05:58:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-08-26 05:58:23,144 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 17 [2021-08-26 05:58:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:23,145 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-08-26 05:58:23,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-08-26 05:58:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 05:58:23,147 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:23,147 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:23,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 05:58:23,147 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1122121916, now seen corresponding path program 1 times [2021-08-26 05:58:23,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:23,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583381262] [2021-08-26 05:58:23,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:23,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:23,176 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:23,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056665191] [2021-08-26 05:58:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:23,180 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:23,191 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) [2021-08-26 05:58:23,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-26 05:58:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:23,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 05:58:23,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:23,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:23,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583381262] [2021-08-26 05:58:23,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:23,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056665191] [2021-08-26 05:58:23,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056665191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:23,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:23,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 05:58:23,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298740489] [2021-08-26 05:58:23,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:58:23,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:23,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:58:23,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:58:23,426 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:23,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:23,491 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-08-26 05:58:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:58:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 05:58:23,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:23,492 INFO L225 Difference]: With dead ends: 69 [2021-08-26 05:58:23,492 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 05:58:23,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 05:58:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2021-08-26 05:58:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-08-26 05:58:23,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 18 [2021-08-26 05:58:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:23,497 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-08-26 05:58:23,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-08-26 05:58:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-26 05:58:23,498 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:23,498 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:23,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:23,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:23,715 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1122125890, now seen corresponding path program 1 times [2021-08-26 05:58:23,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:23,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170569810] [2021-08-26 05:58:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:23,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:23,726 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:23,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117289135] [2021-08-26 05:58:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:23,727 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:23,728 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) [2021-08-26 05:58:23,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-26 05:58:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:23,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 05:58:23,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:23,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:23,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170569810] [2021-08-26 05:58:23,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:23,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117289135] [2021-08-26 05:58:23,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117289135] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:23,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:23,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 05:58:23,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698295364] [2021-08-26 05:58:23,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:58:23,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:58:23,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:23,965 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:24,106 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2021-08-26 05:58:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:58:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-26 05:58:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:24,108 INFO L225 Difference]: With dead ends: 79 [2021-08-26 05:58:24,108 INFO L226 Difference]: Without dead ends: 77 [2021-08-26 05:58:24,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 92.0ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:58:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-08-26 05:58:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2021-08-26 05:58:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-08-26 05:58:24,112 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 18 [2021-08-26 05:58:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:24,113 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-08-26 05:58:24,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-08-26 05:58:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 05:58:24,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:24,113 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:24,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:24,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-08-26 05:58:24,331 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash 326346277, now seen corresponding path program 1 times [2021-08-26 05:58:24,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:24,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180237449] [2021-08-26 05:58:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:24,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:24,342 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:24,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649740209] [2021-08-26 05:58:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:24,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:24,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:24,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:24,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-26 05:58:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:24,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-26 05:58:24,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:24,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:24,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180237449] [2021-08-26 05:58:24,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:24,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649740209] [2021-08-26 05:58:24,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649740209] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:24,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:24,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 05:58:24,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99388467] [2021-08-26 05:58:24,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:58:24,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:58:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:24,727 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:24,832 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-08-26 05:58:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:58:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 05:58:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:24,833 INFO L225 Difference]: With dead ends: 63 [2021-08-26 05:58:24,833 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 05:58:24,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 75.0ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-26 05:58:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 05:58:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2021-08-26 05:58:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-08-26 05:58:24,838 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 20 [2021-08-26 05:58:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:24,838 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-08-26 05:58:24,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-08-26 05:58:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 05:58:24,839 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:24,839 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:24,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:25,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:25,057 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash 86317224, now seen corresponding path program 1 times [2021-08-26 05:58:25,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:25,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098029258] [2021-08-26 05:58:25,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:25,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:25,069 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:25,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340287315] [2021-08-26 05:58:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:25,070 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:25,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:25,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-26 05:58:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:25,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 05:58:25,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:25,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:25,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098029258] [2021-08-26 05:58:25,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:25,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340287315] [2021-08-26 05:58:25,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340287315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:25,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:25,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 05:58:25,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272789392] [2021-08-26 05:58:25,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:58:25,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:58:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:58:25,468 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:25,576 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-08-26 05:58:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:58:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 05:58:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:25,577 INFO L225 Difference]: With dead ends: 61 [2021-08-26 05:58:25,577 INFO L226 Difference]: Without dead ends: 59 [2021-08-26 05:58:25,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.3ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:58:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-08-26 05:58:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2021-08-26 05:58:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-08-26 05:58:25,581 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 22 [2021-08-26 05:58:25,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:25,581 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-08-26 05:58:25,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-08-26 05:58:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 05:58:25,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:25,582 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:25,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:25,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:25,799 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1346631627, now seen corresponding path program 1 times [2021-08-26 05:58:25,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:25,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373617344] [2021-08-26 05:58:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:25,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:25,811 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:25,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090004215] [2021-08-26 05:58:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:25,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:25,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:25,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-26 05:58:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:25,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 05:58:25,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:26,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:26,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373617344] [2021-08-26 05:58:26,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:26,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090004215] [2021-08-26 05:58:26,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090004215] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:26,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:26,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 05:58:26,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421864448] [2021-08-26 05:58:26,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 05:58:26,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 05:58:26,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:58:26,222 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:26,311 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2021-08-26 05:58:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:58:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 05:58:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:26,312 INFO L225 Difference]: With dead ends: 63 [2021-08-26 05:58:26,313 INFO L226 Difference]: Without dead ends: 61 [2021-08-26 05:58:26,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 05:58:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-26 05:58:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2021-08-26 05:58:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1875) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-08-26 05:58:26,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2021-08-26 05:58:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:26,318 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-08-26 05:58:26,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-08-26 05:58:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 05:58:26,319 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:26,319 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:26,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:26,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:26,538 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1781730828, now seen corresponding path program 1 times [2021-08-26 05:58:26,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:26,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459857522] [2021-08-26 05:58:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:26,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:26,549 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:26,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576235398] [2021-08-26 05:58:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:26,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:26,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:26,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-26 05:58:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:26,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 05:58:26,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:26,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:26,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459857522] [2021-08-26 05:58:26,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:26,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576235398] [2021-08-26 05:58:26,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576235398] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:26,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:26,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2021-08-26 05:58:26,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611092099] [2021-08-26 05:58:26,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:58:26,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:26,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:58:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:58:26,867 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:26,928 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2021-08-26 05:58:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:58:26,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-26 05:58:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:26,929 INFO L225 Difference]: With dead ends: 104 [2021-08-26 05:58:26,929 INFO L226 Difference]: Without dead ends: 102 [2021-08-26 05:58:26,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-26 05:58:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2021-08-26 05:58:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2021-08-26 05:58:26,936 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 27 [2021-08-26 05:58:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:26,936 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2021-08-26 05:58:26,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-08-26 05:58:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-26 05:58:26,937 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:26,937 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:26,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:27,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:27,157 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:27,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1655367537, now seen corresponding path program 1 times [2021-08-26 05:58:27,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:27,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778218729] [2021-08-26 05:58:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:27,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:27,167 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:27,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177507842] [2021-08-26 05:58:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:27,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:27,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:27,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:27,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 05:58:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:27,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 05:58:27,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:27,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:27,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778218729] [2021-08-26 05:58:27,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:27,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177507842] [2021-08-26 05:58:27,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177507842] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:27,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:27,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:58:27,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235544698] [2021-08-26 05:58:27,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:58:27,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:58:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:27,545 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:27,659 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2021-08-26 05:58:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 05:58:27,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-26 05:58:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:27,660 INFO L225 Difference]: With dead ends: 165 [2021-08-26 05:58:27,660 INFO L226 Difference]: Without dead ends: 157 [2021-08-26 05:58:27,660 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 63.9ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:58:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-26 05:58:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 109. [2021-08-26 05:58:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 108 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2021-08-26 05:58:27,672 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 30 [2021-08-26 05:58:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:27,673 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2021-08-26 05:58:27,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2021-08-26 05:58:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 05:58:27,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:27,674 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:27,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:27,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:27,890 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1674279834, now seen corresponding path program 1 times [2021-08-26 05:58:27,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:27,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002531887] [2021-08-26 05:58:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:27,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:27,899 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:27,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853635817] [2021-08-26 05:58:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:27,899 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:27,900 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:27,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-26 05:58:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:28,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 05:58:28,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:28,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:28,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002531887] [2021-08-26 05:58:28,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:28,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853635817] [2021-08-26 05:58:28,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853635817] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:28,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:28,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:58:28,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925603707] [2021-08-26 05:58:28,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:58:28,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:28,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:58:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:28,281 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:28,375 INFO L93 Difference]: Finished difference Result 176 states and 211 transitions. [2021-08-26 05:58:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:58:28,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-26 05:58:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:28,377 INFO L225 Difference]: With dead ends: 176 [2021-08-26 05:58:28,377 INFO L226 Difference]: Without dead ends: 170 [2021-08-26 05:58:28,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.1ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:58:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-26 05:58:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-08-26 05:58:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.2847682119205297) internal successors, (194), 156 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2021-08-26 05:58:28,388 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 32 [2021-08-26 05:58:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:28,389 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2021-08-26 05:58:28,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2021-08-26 05:58:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-26 05:58:28,389 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:28,390 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:28,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:28,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-08-26 05:58:28,602 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1629657891, now seen corresponding path program 1 times [2021-08-26 05:58:28,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:28,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907472401] [2021-08-26 05:58:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:28,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:28,610 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:28,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502589250] [2021-08-26 05:58:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:28,610 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:28,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:28,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:28,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-26 05:58:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:28,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjunts are in the unsatisfiable core [2021-08-26 05:58:28,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:29,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:29,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907472401] [2021-08-26 05:58:29,268 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:29,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502589250] [2021-08-26 05:58:29,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502589250] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:29,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:29,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 05:58:29,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534002983] [2021-08-26 05:58:29,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 05:58:29,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:29,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 05:58:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:29,270 INFO L87 Difference]: Start difference. First operand 157 states and 194 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:29,402 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2021-08-26 05:58:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 05:58:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-26 05:58:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:29,403 INFO L225 Difference]: With dead ends: 167 [2021-08-26 05:58:29,403 INFO L226 Difference]: Without dead ends: 165 [2021-08-26 05:58:29,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 75.4ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:58:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-26 05:58:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2021-08-26 05:58:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.271523178807947) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2021-08-26 05:58:29,415 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 34 [2021-08-26 05:58:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:29,415 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2021-08-26 05:58:29,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2021-08-26 05:58:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 05:58:29,416 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:29,416 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:29,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:29,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-26 05:58:29,634 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1561987776, now seen corresponding path program 1 times [2021-08-26 05:58:29,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:29,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825216588] [2021-08-26 05:58:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:29,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:29,642 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:29,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824954404] [2021-08-26 05:58:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:29,642 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:29,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:29,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-26 05:58:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:29,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjunts are in the unsatisfiable core [2021-08-26 05:58:29,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:30,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:30,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825216588] [2021-08-26 05:58:30,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:30,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824954404] [2021-08-26 05:58:30,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824954404] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:30,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:30,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-08-26 05:58:30,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638432826] [2021-08-26 05:58:30,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 05:58:30,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:30,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 05:58:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-26 05:58:30,628 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:30,822 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2021-08-26 05:58:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 05:58:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-26 05:58:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:30,823 INFO L225 Difference]: With dead ends: 172 [2021-08-26 05:58:30,823 INFO L226 Difference]: Without dead ends: 170 [2021-08-26 05:58:30,824 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 167.8ms TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:58:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-08-26 05:58:30,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2021-08-26 05:58:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 156 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 190 transitions. [2021-08-26 05:58:30,831 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 190 transitions. Word has length 36 [2021-08-26 05:58:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:30,832 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 190 transitions. [2021-08-26 05:58:30,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2021-08-26 05:58:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 05:58:30,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:30,833 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:30,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:31,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-26 05:58:31,050 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1088491650, now seen corresponding path program 2 times [2021-08-26 05:58:31,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:31,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393941296] [2021-08-26 05:58:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:31,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:31,059 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:31,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415996081] [2021-08-26 05:58:31,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:58:31,059 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:31,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:31,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:31,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-26 05:58:31,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:58:31,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:58:31,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-26 05:58:31,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:31,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:31,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393941296] [2021-08-26 05:58:31,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:31,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415996081] [2021-08-26 05:58:31,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415996081] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:31,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:31,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-08-26 05:58:31,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231010591] [2021-08-26 05:58:31,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-26 05:58:31,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-26 05:58:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-26 05:58:31,948 INFO L87 Difference]: Start difference. First operand 157 states and 190 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:32,480 INFO L93 Difference]: Finished difference Result 179 states and 213 transitions. [2021-08-26 05:58:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 05:58:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-26 05:58:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:32,481 INFO L225 Difference]: With dead ends: 179 [2021-08-26 05:58:32,482 INFO L226 Difference]: Without dead ends: 177 [2021-08-26 05:58:32,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 325.8ms TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2021-08-26 05:58:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-26 05:58:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 166. [2021-08-26 05:58:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 160 states have (on average 1.25) internal successors, (200), 165 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2021-08-26 05:58:32,493 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 36 [2021-08-26 05:58:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:32,509 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2021-08-26 05:58:32,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2021-08-26 05:58:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-26 05:58:32,510 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:32,510 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:32,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:32,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-26 05:58:32,711 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -50686429, now seen corresponding path program 1 times [2021-08-26 05:58:32,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:32,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112609689] [2021-08-26 05:58:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:32,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:32,718 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:32,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089338030] [2021-08-26 05:58:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:32,719 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:32,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:32,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-26 05:58:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:33,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-26 05:58:33,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:33,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:33,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112609689] [2021-08-26 05:58:33,631 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:33,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089338030] [2021-08-26 05:58:33,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089338030] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:33,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:33,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-08-26 05:58:33,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540541205] [2021-08-26 05:58:33,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:58:33,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:58:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:58:33,633 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:33,912 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-08-26 05:58:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 05:58:33,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-26 05:58:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:33,914 INFO L225 Difference]: With dead ends: 202 [2021-08-26 05:58:33,914 INFO L226 Difference]: Without dead ends: 196 [2021-08-26 05:58:33,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 138.8ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-08-26 05:58:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-08-26 05:58:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2021-08-26 05:58:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 188 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 228 transitions. [2021-08-26 05:58:33,924 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 228 transitions. Word has length 39 [2021-08-26 05:58:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:33,924 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 228 transitions. [2021-08-26 05:58:33,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 228 transitions. [2021-08-26 05:58:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-26 05:58:33,925 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:33,925 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:33,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:34,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-26 05:58:34,139 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -269629041, now seen corresponding path program 2 times [2021-08-26 05:58:34,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:34,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604258279] [2021-08-26 05:58:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:34,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:34,149 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:34,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943344808] [2021-08-26 05:58:34,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:58:34,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:34,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:34,159 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:34,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-26 05:58:34,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:58:34,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:58:34,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 05:58:34,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:34,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:34,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604258279] [2021-08-26 05:58:34,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:34,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943344808] [2021-08-26 05:58:34,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943344808] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:34,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:34,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 05:58:34,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453209607] [2021-08-26 05:58:34,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 05:58:34,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 05:58:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 05:58:34,680 INFO L87 Difference]: Start difference. First operand 189 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:34,730 INFO L93 Difference]: Finished difference Result 248 states and 293 transitions. [2021-08-26 05:58:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 05:58:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-08-26 05:58:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:34,731 INFO L225 Difference]: With dead ends: 248 [2021-08-26 05:58:34,731 INFO L226 Difference]: Without dead ends: 174 [2021-08-26 05:58:34,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-26 05:58:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-26 05:58:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2021-08-26 05:58:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 148 states have (on average 1.1824324324324325) internal successors, (175), 153 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2021-08-26 05:58:34,740 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 44 [2021-08-26 05:58:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:34,741 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2021-08-26 05:58:34,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2021-08-26 05:58:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-26 05:58:34,741 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:34,741 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:34,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:34,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-26 05:58:34,960 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash 75787250, now seen corresponding path program 1 times [2021-08-26 05:58:34,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:34,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961593486] [2021-08-26 05:58:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:34,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:34,980 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:34,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728105263] [2021-08-26 05:58:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:34,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:34,986 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:34,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-26 05:58:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 05:58:35,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 63 conjunts are in the unsatisfiable core [2021-08-26 05:58:35,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:36,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:36,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961593486] [2021-08-26 05:58:36,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:36,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728105263] [2021-08-26 05:58:36,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728105263] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:36,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:36,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-08-26 05:58:36,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481607938] [2021-08-26 05:58:36,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 05:58:36,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 05:58:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:58:36,554 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:37,337 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2021-08-26 05:58:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 05:58:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-26 05:58:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:37,338 INFO L225 Difference]: With dead ends: 165 [2021-08-26 05:58:37,338 INFO L226 Difference]: Without dead ends: 163 [2021-08-26 05:58:37,338 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 308.9ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-08-26 05:58:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-26 05:58:37,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 131. [2021-08-26 05:58:37,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 125 states have (on average 1.184) internal successors, (148), 130 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2021-08-26 05:58:37,346 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 45 [2021-08-26 05:58:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:37,346 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2021-08-26 05:58:37,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2021-08-26 05:58:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-26 05:58:37,347 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:37,347 INFO L512 BasicCegarLoop]: trace histogram [4, 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] [2021-08-26 05:58:37,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:37,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:37,566 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash -397708876, now seen corresponding path program 3 times [2021-08-26 05:58:37,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:37,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531202893] [2021-08-26 05:58:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:37,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:37,579 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:37,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954541660] [2021-08-26 05:58:37,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:58:37,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:37,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:37,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-26 05:58:38,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 05:58:38,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:58:38,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-26 05:58:38,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-26 05:58:38,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:38,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531202893] [2021-08-26 05:58:38,616 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:38,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954541660] [2021-08-26 05:58:38,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954541660] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:38,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:38,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2021-08-26 05:58:38,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336975491] [2021-08-26 05:58:38,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 05:58:38,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 05:58:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-26 05:58:38,618 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:38,768 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2021-08-26 05:58:38,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 05:58:38,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-08-26 05:58:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:38,769 INFO L225 Difference]: With dead ends: 131 [2021-08-26 05:58:38,769 INFO L226 Difference]: Without dead ends: 129 [2021-08-26 05:58:38,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-26 05:58:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-08-26 05:58:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2021-08-26 05:58:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 120 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2021-08-26 05:58:38,779 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 45 [2021-08-26 05:58:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:38,779 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2021-08-26 05:58:38,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2021-08-26 05:58:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-26 05:58:38,780 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:38,780 INFO L512 BasicCegarLoop]: 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, 1, 1, 1] [2021-08-26 05:58:38,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:38,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-26 05:58:38,996 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1367297969, now seen corresponding path program 2 times [2021-08-26 05:58:38,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:38,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200869814] [2021-08-26 05:58:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:38,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:39,004 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:39,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339079845] [2021-08-26 05:58:39,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 05:58:39,004 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:39,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:39,009 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:39,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-26 05:58:39,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 05:58:39,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:58:39,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-26 05:58:39,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 05:58:40,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:40,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200869814] [2021-08-26 05:58:40,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:40,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339079845] [2021-08-26 05:58:40,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339079845] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 05:58:40,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 05:58:40,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-08-26 05:58:40,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262455037] [2021-08-26 05:58:40,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 05:58:40,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 05:58:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-26 05:58:40,511 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 05:58:41,222 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2021-08-26 05:58:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-26 05:58:41,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-26 05:58:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 05:58:41,223 INFO L225 Difference]: With dead ends: 161 [2021-08-26 05:58:41,223 INFO L226 Difference]: Without dead ends: 155 [2021-08-26 05:58:41,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 506.9ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-08-26 05:58:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-26 05:58:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2021-08-26 05:58:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.1575342465753424) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2021-08-26 05:58:41,232 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 48 [2021-08-26 05:58:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 05:58:41,232 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2021-08-26 05:58:41,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:58:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2021-08-26 05:58:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-26 05:58:41,232 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 05:58:41,232 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 05:58:41,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-26 05:58:41,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-26 05:58:41,433 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 05:58:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 05:58:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash 194484878, now seen corresponding path program 3 times [2021-08-26 05:58:41,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 05:58:41,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614008438] [2021-08-26 05:58:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 05:58:41,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 05:58:41,444 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 05:58:41,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992217315] [2021-08-26 05:58:41,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 05:58:41,445 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 05:58:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 05:58:41,445 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 05:58:41,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-26 05:58:42,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 05:58:42,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 05:58:42,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 38 conjunts are in the unsatisfiable core [2021-08-26 05:58:42,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 05:58:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-26 05:58:50,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 05:58:50,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614008438] [2021-08-26 05:58:50,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 05:58:50,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992217315] [2021-08-26 05:58:50,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992217315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 05:58:50,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 05:58:50,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-26 05:58:50,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916681323] [2021-08-26 05:58:50,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 05:58:50,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 05:58:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 05:58:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=3, NotChecked=0, Total=156 [2021-08-26 05:58:50,022 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 05:59:22,482 WARN L207 SmtUtils]: Spent 18.16 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-08-26 05:59:40,625 WARN L207 SmtUtils]: Spent 16.13 s on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2021-08-26 06:00:00,865 WARN L207 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-08-26 06:00:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:25,217 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2021-08-26 06:00:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 06:00:25,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-08-26 06:00:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:25,219 INFO L225 Difference]: With dead ends: 153 [2021-08-26 06:00:25,220 INFO L226 Difference]: Without dead ends: 147 [2021-08-26 06:00:25,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 81538.6ms TimeCoverageRelationStatistics Valid=141, Invalid=397, Unknown=14, NotChecked=0, Total=552 [2021-08-26 06:00:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-26 06:00:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2021-08-26 06:00:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2021-08-26 06:00:25,249 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 51 [2021-08-26 06:00:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:25,250 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2021-08-26 06:00:25,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2021-08-26 06:00:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-26 06:00:25,250 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 06:00:25,250 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 06:00:25,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-26 06:00:25,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-26 06:00:25,465 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 06:00:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 06:00:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2078434191, now seen corresponding path program 1 times [2021-08-26 06:00:25,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 06:00:25,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215204469] [2021-08-26 06:00:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:25,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 06:00:25,471 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 06:00:25,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819273425] [2021-08-26 06:00:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:25,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:25,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 06:00:25,483 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 06:00:25,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-26 06:00:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 06:00:26,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-26 06:00:26,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 06:00:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 06:00:26,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 06:00:26,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215204469] [2021-08-26 06:00:26,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 06:00:26,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819273425] [2021-08-26 06:00:26,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819273425] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 06:00:26,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 06:00:26,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2021-08-26 06:00:26,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180704282] [2021-08-26 06:00:26,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 06:00:26,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 06:00:26,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 06:00:26,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 06:00:26,365 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:26,595 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2021-08-26 06:00:26,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 06:00:26,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-08-26 06:00:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:26,597 INFO L225 Difference]: With dead ends: 219 [2021-08-26 06:00:26,597 INFO L226 Difference]: Without dead ends: 213 [2021-08-26 06:00:26,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 124.6ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-26 06:00:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-26 06:00:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 163. [2021-08-26 06:00:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1320754716981132) internal successors, (180), 162 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2021-08-26 06:00:26,643 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 53 [2021-08-26 06:00:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:26,643 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2021-08-26 06:00:26,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2021-08-26 06:00:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-26 06:00:26,644 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 06:00:26,644 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-08-26 06:00:26,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-26 06:00:26,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:26,863 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 06:00:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 06:00:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2074616969, now seen corresponding path program 1 times [2021-08-26 06:00:26,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 06:00:26,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571952886] [2021-08-26 06:00:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:26,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 06:00:26,872 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 06:00:26,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840451072] [2021-08-26 06:00:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:26,874 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 06:00:26,875 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 06:00:26,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-26 06:00:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 06:00:27,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-26 06:00:27,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 06:00:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-26 06:00:27,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 06:00:27,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571952886] [2021-08-26 06:00:27,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 06:00:27,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840451072] [2021-08-26 06:00:27,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840451072] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 06:00:27,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 06:00:27,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 06:00:27,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904764725] [2021-08-26 06:00:27,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 06:00:27,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 06:00:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 06:00:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-26 06:00:27,857 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:28,093 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2021-08-26 06:00:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 06:00:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-08-26 06:00:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:28,094 INFO L225 Difference]: With dead ends: 165 [2021-08-26 06:00:28,094 INFO L226 Difference]: Without dead ends: 155 [2021-08-26 06:00:28,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.4ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-26 06:00:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-26 06:00:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 97. [2021-08-26 06:00:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.0842105263157895) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2021-08-26 06:00:28,104 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 53 [2021-08-26 06:00:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:28,104 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2021-08-26 06:00:28,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2021-08-26 06:00:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-26 06:00:28,105 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 06:00:28,105 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 06:00:28,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-08-26 06:00:28,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:28,324 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 06:00:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 06:00:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1634778368, now seen corresponding path program 2 times [2021-08-26 06:00:28,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 06:00:28,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733440011] [2021-08-26 06:00:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:28,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 06:00:28,331 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 06:00:28,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375371099] [2021-08-26 06:00:28,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 06:00:28,331 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 06:00:28,336 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 06:00:28,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-26 06:00:29,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-26 06:00:29,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 06:00:29,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 06:00:29,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 06:00:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-26 06:00:32,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 06:00:32,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733440011] [2021-08-26 06:00:32,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 06:00:32,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375371099] [2021-08-26 06:00:32,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375371099] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 06:00:32,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 06:00:32,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-08-26 06:00:32,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193847387] [2021-08-26 06:00:32,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 06:00:32,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 06:00:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 06:00:32,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-26 06:00:32,687 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:34,211 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2021-08-26 06:00:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 06:00:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-26 06:00:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:34,211 INFO L225 Difference]: With dead ends: 97 [2021-08-26 06:00:34,211 INFO L226 Difference]: Without dead ends: 95 [2021-08-26 06:00:34,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1105.2ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-26 06:00:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-26 06:00:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2021-08-26 06:00:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-08-26 06:00:34,230 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 54 [2021-08-26 06:00:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:34,230 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-08-26 06:00:34,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2021-08-26 06:00:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-26 06:00:34,230 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 06:00:34,230 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 06:00:34,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-26 06:00:34,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-08-26 06:00:34,441 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 06:00:34,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 06:00:34,442 INFO L82 PathProgramCache]: Analyzing trace with hash -841924230, now seen corresponding path program 1 times [2021-08-26 06:00:34,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 06:00:34,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936845018] [2021-08-26 06:00:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:34,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 06:00:34,480 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 06:00:34,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912953344] [2021-08-26 06:00:34,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:34,481 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:34,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 06:00:34,482 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 06:00:34,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-26 06:00:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 06:00:35,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 95 conjunts are in the unsatisfiable core [2021-08-26 06:00:35,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 06:00:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 06:00:37,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 06:00:37,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936845018] [2021-08-26 06:00:37,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 06:00:37,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912953344] [2021-08-26 06:00:37,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912953344] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 06:00:37,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 06:00:37,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-08-26 06:00:37,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787718685] [2021-08-26 06:00:37,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 06:00:37,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 06:00:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 06:00:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-08-26 06:00:37,167 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:37,988 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2021-08-26 06:00:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-26 06:00:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-08-26 06:00:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:37,989 INFO L225 Difference]: With dead ends: 139 [2021-08-26 06:00:37,989 INFO L226 Difference]: Without dead ends: 137 [2021-08-26 06:00:37,989 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 809.5ms TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2021-08-26 06:00:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-26 06:00:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 86. [2021-08-26 06:00:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-08-26 06:00:37,999 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 55 [2021-08-26 06:00:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:38,000 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-08-26 06:00:38,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-08-26 06:00:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-26 06:00:38,004 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 06:00:38,004 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 06:00:38,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-08-26 06:00:38,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-08-26 06:00:38,226 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 06:00:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 06:00:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1920559695, now seen corresponding path program 2 times [2021-08-26 06:00:38,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 06:00:38,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070676370] [2021-08-26 06:00:38,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:38,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 06:00:38,233 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 06:00:38,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728804254] [2021-08-26 06:00:38,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 06:00:38,233 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 06:00:38,236 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 06:00:38,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-26 06:00:39,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 06:00:39,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 06:00:39,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-26 06:00:39,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 06:00:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 06:00:40,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 06:00:40,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070676370] [2021-08-26 06:00:40,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 06:00:40,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728804254] [2021-08-26 06:00:40,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728804254] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 06:00:40,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 06:00:40,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-08-26 06:00:40,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355008780] [2021-08-26 06:00:40,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 06:00:40,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 06:00:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 06:00:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-26 06:00:40,303 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:40,888 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2021-08-26 06:00:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-26 06:00:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-08-26 06:00:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:40,889 INFO L225 Difference]: With dead ends: 140 [2021-08-26 06:00:40,889 INFO L226 Difference]: Without dead ends: 138 [2021-08-26 06:00:40,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 238.9ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-08-26 06:00:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-08-26 06:00:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 95. [2021-08-26 06:00:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2021-08-26 06:00:40,913 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 61 [2021-08-26 06:00:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:40,914 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2021-08-26 06:00:40,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2021-08-26 06:00:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-26 06:00:40,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 06:00:40,915 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 06:00:40,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-26 06:00:41,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:41,133 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-08-26 06:00:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 06:00:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -132092270, now seen corresponding path program 3 times [2021-08-26 06:00:41,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 06:00:41,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939521514] [2021-08-26 06:00:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 06:00:41,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 06:00:41,153 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-26 06:00:41,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183818747] [2021-08-26 06:00:41,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 06:00:41,153 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:41,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 06:00:41,154 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 06:00:41,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-26 06:00:43,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-26 06:00:43,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 06:00:43,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2021-08-26 06:00:43,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 06:00:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-26 06:00:44,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 06:00:44,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939521514] [2021-08-26 06:00:44,483 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-26 06:00:44,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183818747] [2021-08-26 06:00:44,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183818747] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 06:00:44,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-08-26 06:00:44,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-08-26 06:00:44,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935766290] [2021-08-26 06:00:44,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 06:00:44,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 06:00:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 06:00:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-08-26 06:00:44,484 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 06:00:47,757 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-08-26 06:00:47,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 06:00:47,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-08-26 06:00:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 06:00:47,758 INFO L225 Difference]: With dead ends: 95 [2021-08-26 06:00:47,758 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 06:00:47,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 654.0ms TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-08-26 06:00:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 06:00:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 06:00:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 06:00:47,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2021-08-26 06:00:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 06:00:47,759 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 06:00:47,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 06:00:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 06:00:47,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 06:00:47,762 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 06:00:47,762 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 06:00:47,762 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 06:00:47,762 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 06:00:47,762 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 06:00:47,763 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 06:00:47,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-26 06:00:47,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 06:00:47,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 06:00:47,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:47,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,549 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:00:48,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 06:01:16,034 WARN L207 SmtUtils]: Spent 23.29 s on a formula simplification. DAG size of input: 187 DAG size of output: 52 [2021-08-26 06:01:31,154 WARN L207 SmtUtils]: Spent 15.12 s on a formula simplification. DAG size of input: 177 DAG size of output: 70 [2021-08-26 06:01:50,015 WARN L207 SmtUtils]: Spent 18.86 s on a formula simplification. DAG size of input: 180 DAG size of output: 54 [2021-08-26 06:01:59,153 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L853 garLoopResultBuilder]: At program point L11-2(lines 10 16) the Hoare annotation is: (let ((.cse7 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (and (<= 1 ULTIMATE.start_main_~x~0) (let ((.cse0 (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) .cse7)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (.cse5 (<= ULTIMATE.start_main_~x~0 10)) (.cse6 (<= ULTIMATE.start_main_~y~0 10))) (or (and .cse0 (= ULTIMATE.start_main_~p~0 1) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) .cse5 .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_main_~b~0 0)) .cse5 .cse6))) (= ULTIMATE.start_main_~a~0 .cse7))) [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point L11-3(lines 11 14) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L853 garLoopResultBuilder]: At program point L11-5(lines 10 16) the Hoare annotation is: (let ((.cse0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (and (<= 1 ULTIMATE.start_main_~y~0) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 .cse0) (let ((.cse1 (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) .cse0)) (.cse4 (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (.cse5 (<= ULTIMATE.start_main_~x~0 10)) (.cse6 (<= ULTIMATE.start_main_~y~0 10))) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_main_~b~0 0)) .cse5 .cse6) (and .cse1 (= ULTIMATE.start_main_~p~0 1) .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) .cse5 .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))))) [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point L11-6(lines 11 14) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L853 garLoopResultBuilder]: At program point L11-8(lines 10 16) the Hoare annotation is: (let ((.cse7 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (and (<= 1 ULTIMATE.start_main_~x~0) (let ((.cse0 (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) .cse7)) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (.cse5 (<= ULTIMATE.start_main_~x~0 10)) (.cse6 (<= ULTIMATE.start_main_~y~0 10))) (or (and .cse0 (= ULTIMATE.start_main_~p~0 1) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) .cse5 .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_main_~b~0 0)) .cse5 .cse6))) (= ULTIMATE.start_main_~a~0 .cse7))) [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point L11-9(lines 11 14) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L853 garLoopResultBuilder]: At program point L11-11(lines 52 53) the Hoare annotation is: (and (let ((.cse7 (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)))) (let ((.cse0 (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= .cse7 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (.cse3 (<= 1 ULTIMATE.start_main_~y~0)) (.cse4 (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (.cse5 (<= ULTIMATE.start_main_~x~0 10)) (.cse6 (<= ULTIMATE.start_main_~y~0 10))) (or (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) .cse0 (= ULTIMATE.start_main_~p~0 1) .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) .cse5 .cse6 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= .cse7 ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_main_~b~0 0)) .cse5 .cse6)))) (<= 1 ULTIMATE.start_main_~x~0)) [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point L11-12(lines 11 14) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-08-26 06:01:59,155 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L853 garLoopResultBuilder]: At program point L11-14(lines 10 16) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~b~0)) (.cse1 (<= 1 ULTIMATE.start_main_~y~0)) (.cse2 (<= ULTIMATE.start_main_~x~0 10)) (.cse3 (<= 1 ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (.cse5 (<= ULTIMATE.start_main_~y~0 10))) (or (and .cse0 (= ULTIMATE.start_main_~p~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse0 (<= 0 ULTIMATE.start___VERIFIER_assert_~cond) .cse1 .cse2 .cse3 .cse4 .cse5))) [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L11-15(lines 11 14) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L860 garLoopResultBuilder]: At program point L11-17(lines 10 16) the Hoare annotation is: true [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L12-1(lines 12 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L12-2(lines 12 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L12-3(lines 12 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L12-4(lines 12 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L12-5(lines 12 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L853 garLoopResultBuilder]: At program point L47-2(lines 47 56) the Hoare annotation is: (let ((.cse16 (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0))) (.cse17 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (let ((.cse1 (= ULTIMATE.start_main_~p~0 1)) (.cse6 (= ULTIMATE.start_main_~q~0 0)) (.cse7 (= ULTIMATE.start_main_~r~0 0)) (.cse8 (= ULTIMATE.start_main_~s~0 1)) (.cse11 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse12 (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0)) (.cse14 (= ULTIMATE.start_main_~a~0 .cse17)) (.cse0 (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= .cse16 .cse17)) (.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (.cse15 (not (= ULTIMATE.start_main_~b~0 0))) (.cse9 (<= ULTIMATE.start_main_~x~0 10)) (.cse13 (<= 1 ULTIMATE.start_main_~x~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 10))) (or (and (<= 1 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse11) (and (exists ((ULTIMATE.start_main_~k~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~k~0)))) (= ULTIMATE.start_main_~k~0 0) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse4 .cse5 .cse12 .cse15 .cse9 .cse13 .cse14 .cse10) (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= .cse16 ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse9 .cse13 .cse10)))) [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L47-3(lines 47 56) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L860 garLoopResultBuilder]: At program point L73(lines 18 74) the Hoare annotation is: true [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L7-1(lines 7 9) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L7-2(lines 7 9) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L7-3(lines 7 9) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L7-4(lines 7 9) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-08-26 06:01:59,156 INFO L857 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L853 garLoopResultBuilder]: At program point L41-1(lines 7 68) the Hoare annotation is: (let ((.cse0 (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0)) (.cse1 (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (.cse2 (<= ULTIMATE.start_main_~x~0 10)) (.cse3 (<= 1 ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (.cse5 (<= ULTIMATE.start_main_~y~0 10))) (or (and (exists ((ULTIMATE.start_main_~k~0 Int)) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~k~0)))) (< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0) .cse0 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 1 ULTIMATE.start_main_~y~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~b~0) .cse1 (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))) [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L41-2(lines 41 68) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L8-2(line 8) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L8-4(line 8) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L8-6(line 8) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L8-8(line 8) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L8-10(line 8) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 43) no Hoare annotation was computed. [2021-08-26 06:01:59,157 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-08-26 06:01:59,159 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 06:01:59,170 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,172 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,173 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,173 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:01:59 BoogieIcfgContainer [2021-08-26 06:01:59,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 06:01:59,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 06:01:59,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 06:01:59,179 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 06:01:59,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:58:22" (3/4) ... [2021-08-26 06:01:59,182 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 06:01:59,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-08-26 06:01:59,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-26 06:01:59,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 06:01:59,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 06:01:59,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\exists ULTIMATE.start_main_~k~0 : int :: s * y + q * x + r * y * ULTIMATE.start_main_~k~0 + p * x * ULTIMATE.start_main_~k~0 == b + a * ULTIMATE.start_main_~k~0) && b < a) && x * y == xy) && 1 <= cond) && 1 <= y) && yy == y * y) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) || (((((((((((x * y == xy && p == 1) && 1 <= b) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) && b == y) [2021-08-26 06:01:59,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((1 <= a && a == x) && x * y == xy) && p == 1) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && y <= 10) && b == y) || (((((((((((((x * y == xy && p == 1) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && c == a) && r == 0) && s == 1) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) && b == y)) || (((((((((((((\exists ULTIMATE.start_main_~k~0 : int :: s * y + q * x + r * y * ULTIMATE.start_main_~k~0 + p * x * ULTIMATE.start_main_~k~0 == b + a * ULTIMATE.start_main_~k~0) && k == 0) && b < c) && x * y == xy) && 1 <= cond) && 1 <= y) && yy == y * y) && c == a) && !(b == 0)) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10)) || (((((((((((s * y + q * x == b && c + b * k == a) && b < a) && x * y == xy) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && !(b == 0)) && x <= 10) && 1 <= x) && y <= 10) [2021-08-26 06:01:59,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 06:01:59,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 06:01:59,218 INFO L168 Benchmark]: Toolchain (without parser) took 216982.07 ms. Allocated memory was 52.4 MB in the beginning and 436.2 MB in the end (delta: 383.8 MB). Free memory was 29.8 MB in the beginning and 341.1 MB in the end (delta: -311.3 MB). Peak memory consumption was 70.9 MB. Max. memory is 16.1 GB. [2021-08-26 06:01:59,218 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 52.4 MB. Free memory is still 34.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 06:01:59,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.23 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 29.6 MB in the beginning and 56.9 MB in the end (delta: -27.2 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2021-08-26 06:01:59,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.67 ms. Allocated memory is still 73.4 MB. Free memory was 56.9 MB in the beginning and 55.0 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 06:01:59,219 INFO L168 Benchmark]: Boogie Preprocessor took 32.23 ms. Allocated memory is still 73.4 MB. Free memory was 55.0 MB in the beginning and 53.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 06:01:59,219 INFO L168 Benchmark]: RCFGBuilder took 396.35 ms. Allocated memory is still 73.4 MB. Free memory was 53.7 MB in the beginning and 54.6 MB in the end (delta: -949.5 kB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. [2021-08-26 06:01:59,219 INFO L168 Benchmark]: TraceAbstraction took 216251.95 ms. Allocated memory was 73.4 MB in the beginning and 436.2 MB in the end (delta: 362.8 MB). Free memory was 54.0 MB in the beginning and 345.2 MB in the end (delta: -291.3 MB). Peak memory consumption was 297.0 MB. Max. memory is 16.1 GB. [2021-08-26 06:01:59,220 INFO L168 Benchmark]: Witness Printer took 38.23 ms. Allocated memory is still 436.2 MB. Free memory was 345.2 MB in the beginning and 341.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 06:01:59,221 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.09 ms. Allocated memory is still 52.4 MB. Free memory is still 34.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 220.23 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 29.6 MB in the beginning and 56.9 MB in the end (delta: -27.2 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.67 ms. Allocated memory is still 73.4 MB. Free memory was 56.9 MB in the beginning and 55.0 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.23 ms. Allocated memory is still 73.4 MB. Free memory was 55.0 MB in the beginning and 53.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 396.35 ms. Allocated memory is still 73.4 MB. Free memory was 53.7 MB in the beginning and 54.6 MB in the end (delta: -949.5 kB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 216251.95 ms. Allocated memory was 73.4 MB in the beginning and 436.2 MB in the end (delta: 362.8 MB). Free memory was 54.0 MB in the beginning and 345.2 MB in the end (delta: -291.3 MB). Peak memory consumption was 297.0 MB. Max. memory is 16.1 GB. * Witness Printer took 38.23 ms. Allocated memory is still 436.2 MB. Free memory was 345.2 MB in the beginning and 341.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 216188.4ms, OverallIterations: 24, TraceHistogramMax: 5, EmptinessCheckTime: 19.7ms, AutomataDifference: 105547.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 71181.9ms, InitialAbstractionConstructionTime: 9.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 767 SDtfs, 1519 SDslu, 2536 SDs, 0 SdLazy, 3922 SolverSat, 405 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 26633.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1013 GetRequests, 733 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 86584.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=13, InterpolantAutomatonStates: 241, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 271.1ms AutomataMinimizationTime, 24 MinimizatonAttempts, 498 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 55 NumberOfFragments, 889 HoareAnnotationTreeSize, 9 FomulaSimplifications, 555195 FormulaSimplificationTreeSizeReduction, 840.7ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 117988 FormulaSimplificationTreeSizeReductionInter, 70333.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 180.3ms SsaConstructionTime, 2246.2ms SatisfiabilityAnalysisTime, 21863.7ms InterpolantComputationTime, 926 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 902 ConstructedInterpolants, 6 QuantifiedInterpolants, 10663 SizeOfPredicates, 295 NumberOfNonLiveVariables, 3576 ConjunctsInSsa, 694 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 272/549 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: ((1 <= y && 1 <= x) && a == r * y + p * x) && (((((((((s * y + q * x == b && b < a) && x * y == xy) && 1 == cond) && c + b * k == r * y + p * x) && yy == y * y) && !(b == 0)) && x <= 10) && y <= 10) || ((((((((((x * y == xy && p == 1) && 1 == cond) && c + b * k == r * y + p * x) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && y <= 10) && b == y)) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (1 <= x && ((((((((((((x * y == xy && p == 1) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && y <= 10) && b == y) || (((((((((s * y + q * x == b && b < a) && x * y == xy) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && !(b == 0)) && x <= 10) && y <= 10))) && a == r * y + p * x - InvariantResult [Line: 47]: Loop Invariant [2021-08-26 06:01:59,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: (((((((((((((((1 <= a && a == x) && x * y == xy) && p == 1) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && y <= 10) && b == y) || (((((((((((((x * y == xy && p == 1) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && c == a) && r == 0) && s == 1) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) && b == y)) || (((((((((((((\exists ULTIMATE.start_main_~k~0 : int :: s * y + q * x + r * y * ULTIMATE.start_main_~k~0 + p * x * ULTIMATE.start_main_~k~0 == b + a * ULTIMATE.start_main_~k~0) && k == 0) && b < c) && x * y == xy) && 1 <= cond) && 1 <= y) && yy == y * y) && c == a) && !(b == 0)) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10)) || (((((((((((s * y + q * x == b && c + b * k == a) && b < a) && x * y == xy) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && !(b == 0)) && x <= 10) && 1 <= x) && y <= 10) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((a == x && x * y == xy) && p == 1) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && y <= 10) && b == y) || ((((((((((s * y + q * x == b && c + b * k == a) && b < a) && x * y == xy) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && !(b == 0)) && x <= 10) && y <= 10)) && 1 <= x - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: ((((((0 <= b && p == 0) && 1 <= y) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) || (((((((b < a && 0 <= b) && 0 <= cond) && 1 <= y) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (1 <= x && ((((((((((((x * y == xy && p == 1) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && y <= 10) && b == y) || (((((((((s * y + q * x == b && b < a) && x * y == xy) && 1 == cond) && c + b * k == r * y + p * x) && 1 <= y) && yy == y * y) && !(b == 0)) && x <= 10) && y <= 10))) && a == r * y + p * x - InvariantResult [Line: 7]: Loop Invariant [2021-08-26 06:01:59,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] [2021-08-26 06:01:59,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~k~0,QUANTIFIED] Derived loop invariant: ((((((((((\exists ULTIMATE.start_main_~k~0 : int :: s * y + q * x + r * y * ULTIMATE.start_main_~k~0 + p * x * ULTIMATE.start_main_~k~0 == b + a * ULTIMATE.start_main_~k~0) && b < a) && x * y == xy) && 1 <= cond) && 1 <= y) && yy == y * y) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) || (((((((((((x * y == xy && p == 1) && 1 <= b) && yy == y * y) && q == 0) && r == 0) && s == 1) && x <= 10) && 1 <= x) && a == r * y + p * x) && y <= 10) && b == y) RESULT: Ultimate proved your program to be correct! [2021-08-26 06:01:59,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...