./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/gcd_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/bitvector/gcd_1.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 739715c3f9b6cd78741b6d155210624f17d4bf167a3be4c6127f06707080edde --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:31:28,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:31:28,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:31:28,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:31:28,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:31:28,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:31:28,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:31:28,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:31:28,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:31:28,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:31:28,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:31:28,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:31:28,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:31:28,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:31:28,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:31:28,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:31:28,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:31:28,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:31:28,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:31:28,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:31:28,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:31:28,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:31:28,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:31:28,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:31:28,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:31:28,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:31:28,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:31:28,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:31:28,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:31:28,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:31:28,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:31:28,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:31:28,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:31:28,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:31:28,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:31:28,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:31:28,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:31:28,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:31:28,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:31:28,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:31:28,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:31:28,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:31:28,221 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:31:28,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:31:28,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:31:28,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:31:28,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:31:28,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:31:28,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:31:28,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:31:28,225 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:31:28,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:31:28,226 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:31:28,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:31:28,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:31:28,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:31:28,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:31:28,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:31:28,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:31:28,227 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:31:28,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:31:28,228 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:31:28,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:31:28,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:31:28,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:31:28,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:31:28,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:31:28,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:31:28,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:31:28,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:31:28,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:31:28,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:31:28,230 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:31:28,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:31:28,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:31:28,231 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:31:28,231 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 -> 739715c3f9b6cd78741b6d155210624f17d4bf167a3be4c6127f06707080edde [2021-12-17 02:31:28,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:31:28,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:31:28,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:31:28,469 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:31:28,470 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:31:28,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_1.c [2021-12-17 02:31:28,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccdf407dd/2cbc58c4deeb4b6ebb918e51a3f7ec9a/FLAG6ca385494 [2021-12-17 02:31:28,857 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:31:28,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_1.c [2021-12-17 02:31:28,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccdf407dd/2cbc58c4deeb4b6ebb918e51a3f7ec9a/FLAG6ca385494 [2021-12-17 02:31:29,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccdf407dd/2cbc58c4deeb4b6ebb918e51a3f7ec9a [2021-12-17 02:31:29,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:31:29,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:31:29,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:31:29,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:31:29,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:31:29,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae8d3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29, skipping insertion in model container [2021-12-17 02:31:29,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:31:29,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:31:29,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_1.c[664,677] [2021-12-17 02:31:29,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:31:29,466 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:31:29,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_1.c[664,677] [2021-12-17 02:31:29,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:31:29,499 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:31:29,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29 WrapperNode [2021-12-17 02:31:29,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:31:29,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:31:29,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:31:29,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:31:29,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,528 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2021-12-17 02:31:29,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:31:29,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:31:29,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:31:29,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:31:29,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:31:29,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:31:29,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:31:29,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:31:29,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (1/1) ... [2021-12-17 02:31:29,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:31:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:31:29,613 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-12-17 02:31:29,652 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-12-17 02:31:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:31:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:31:29,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:31:29,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:31:29,722 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:31:29,723 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:31:29,842 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:31:29,855 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:31:29,855 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 02:31:29,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:31:29 BoogieIcfgContainer [2021-12-17 02:31:29,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:31:29,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:31:29,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:31:29,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:31:29,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:31:29" (1/3) ... [2021-12-17 02:31:29,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd30596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:31:29, skipping insertion in model container [2021-12-17 02:31:29,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:31:29" (2/3) ... [2021-12-17 02:31:29,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd30596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:31:29, skipping insertion in model container [2021-12-17 02:31:29,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:31:29" (3/3) ... [2021-12-17 02:31:29,878 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_1.c [2021-12-17 02:31:29,881 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:31:29,882 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:31:29,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:31:29,938 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:31:29,938 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:31:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-12-17 02:31:29,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 02:31:29,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:31:29,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:31:29,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:31:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:31:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2002478831, now seen corresponding path program 1 times [2021-12-17 02:31:29,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:31:29,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124505781] [2021-12-17 02:31:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:31:29,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:31:30,058 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:31:30,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012541905] [2021-12-17 02:31:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:31:30,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:31:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:31:30,062 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-12-17 02:31:30,092 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-12-17 02:31:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:31:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 02:31:30,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:31:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:31:30,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 02:31:30,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:31:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124505781] [2021-12-17 02:31:30,201 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:31:30,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012541905] [2021-12-17 02:31:30,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012541905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:31:30,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:31:30,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:31:30,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631474494] [2021-12-17 02:31:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:31:30,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:31:30,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:31:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:31:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:31:30,230 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-12-17 02:31:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:31:30,248 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-12-17 02:31:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:31:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2021-12-17 02:31:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:31:30,254 INFO L225 Difference]: With dead ends: 28 [2021-12-17 02:31:30,255 INFO L226 Difference]: Without dead ends: 12 [2021-12-17 02:31:30,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:31:30,260 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:31:30,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:31:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-17 02:31:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-17 02:31:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-12-17 02:31:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-17 02:31:30,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2021-12-17 02:31:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:31:30,286 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-17 02:31:30,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-12-17 02:31:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-12-17 02:31:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 02:31:30,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:31:30,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:31:30,306 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-12-17 02:31:30,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-17 02:31:30,503 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:31:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:31:30,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1895646932, now seen corresponding path program 1 times [2021-12-17 02:31:30,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:31:30,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850961656] [2021-12-17 02:31:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:31:30,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:31:30,510 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:31:30,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859273276] [2021-12-17 02:31:30,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:31:30,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:31:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:31:30,516 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-12-17 02:31:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:31:30,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 02:31:30,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:31:30,582 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-12-17 02:31:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:31:30,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:31:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:31:30,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:31:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850961656] [2021-12-17 02:31:30,696 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:31:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859273276] [2021-12-17 02:31:30,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859273276] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:31:30,697 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:31:30,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-17 02:31:30,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844490721] [2021-12-17 02:31:30,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:31:30,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:31:30,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:31:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:31:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:31:30,702 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-12-17 02:31:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:31:30,748 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2021-12-17 02:31:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 02:31:30,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2021-12-17 02:31:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:31:30,752 INFO L225 Difference]: With dead ends: 18 [2021-12-17 02:31:30,752 INFO L226 Difference]: Without dead ends: 13 [2021-12-17 02:31:30,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 02:31:30,754 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:31:30,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:31:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-17 02:31:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-17 02:31:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-12-17 02:31:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-12-17 02:31:30,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-12-17 02:31:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:31:30,760 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-12-17 02:31:30,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-12-17 02:31:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-12-17 02:31:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 02:31:30,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:31:30,761 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:31:30,776 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-12-17 02:31:30,976 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,SelfDestructingSolverStorable1 [2021-12-17 02:31:30,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:31:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:31:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1416141937, now seen corresponding path program 2 times [2021-12-17 02:31:30,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:31:30,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860165258] [2021-12-17 02:31:30,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:31:30,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:31:30,982 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:31:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566965440] [2021-12-17 02:31:30,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:31:30,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:31:30,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:31:30,987 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-12-17 02:31:31,001 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-12-17 02:31:38,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:31:38,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:31:38,567 WARN L261 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-17 02:31:38,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:32:30,579 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main_~y~0#1|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 02:32:44,412 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (mod (mod |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main_~y~0#1|)))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 02:32:56,803 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_#res#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main_~y~0#1|)))) (= 0 (mod (mod |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_gcd_test_#res#1|) 256)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|)) is different from false [2021-12-17 02:34:17,857 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |ULTIMATE.start_main_~y~0#1|) 256))) (and (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< 0 |ULTIMATE.start_main_~y~0#1|) (= 0 (mod (mod |ULTIMATE.start_main_~y~0#1| .cse0) 256)) (not (= 0 .cse0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_main_~y~0#1|))))) (<= 0 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|)) is different from false [2021-12-17 02:35:01,355 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |ULTIMATE.start_main_~y~0#1|) 256))) (and (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< 0 |ULTIMATE.start_main_~y~0#1|) (= 0 (mod (mod |ULTIMATE.start_main_~y~0#1| .cse0) 256)) (not (= 0 .cse0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_main_~y~0#1|))))) is different from false [2021-12-17 02:35:03,358 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |ULTIMATE.start_main_~y~0#1|) 256))) (and (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< 0 |ULTIMATE.start_main_~y~0#1|) (= 0 (mod (mod |ULTIMATE.start_main_~y~0#1| .cse0) 256)) (not (= 0 .cse0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_main_~y~0#1|))))) is different from true [2021-12-17 02:35:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 02:35:03,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:35:31,461 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse7 (+ |c_ULTIMATE.start_main_~y~0#1| 256)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse11 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse1 (or .cse10 (= .cse11 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse11) 256))) (= 0 .cse11))) (.cse3 (< 127 .cse11)) (.cse5 (<= .cse11 127)) (.cse4 (or .cse10 (= .cse11 .cse7) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse11 (- 256))) 256))))) (.cse6 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse2 (or (= .cse6 .cse7) .cse8 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse6 (- 256))) 256)))))) (and (or (and .cse1 .cse2) .cse3) (or (and .cse2 .cse4) .cse5))) (<= .cse6 127)) (or (let ((.cse9 (or (= 0 .cse6) (= .cse6 |c_ULTIMATE.start_main_~y~0#1|) .cse8 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse6) 256)))))) (and (or (and .cse1 .cse9) .cse3) (or .cse5 (and .cse9 .cse4)))) (< 127 .cse6)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse15 (mod .cse0 256))) (and (or (let ((.cse12 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256)))) (.cse13 (= 0 .cse15)) (.cse14 (= .cse15 |c_ULTIMATE.start_main_~y~0#1|))) (and (or .cse12 .cse13 .cse14) (or .cse10 .cse12 .cse13 .cse14))) (< 127 .cse15)) (or (let ((.cse16 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse15 (- 256))) 256)))) (.cse17 (= .cse15 .cse7))) (and (or .cse16 .cse17 .cse8) (or .cse16 .cse17 .cse10))) (<= .cse15 127))))))) is different from true [2021-12-17 02:35:45,507 WARN L227 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:37:06,937 WARN L227 SmtUtils]: Spent 28.92s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:37:18,236 WARN L227 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 02:38:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 02:38:10,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:38:10,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860165258] [2021-12-17 02:38:10,141 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:38:10,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566965440] [2021-12-17 02:38:10,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566965440] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:38:10,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:38:10,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2021-12-17 02:38:10,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074272816] [2021-12-17 02:38:10,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:38:10,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 02:38:10,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:38:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 02:38:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=140, Unknown=20, NotChecked=174, Total=380 [2021-12-17 02:38:10,144 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-12-17 02:39:03,988 WARN L227 SmtUtils]: Spent 49.26s on a formula simplification. DAG size of input: 44 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:39:06,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main_~y~0#1| 256)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= |c_ULTIMATE.start_main_~x~0#1| 127) (or .cse0 .cse1 (let ((.cse4 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (or (let ((.cse2 (mod (mod .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (and (or (< 127 .cse2) (= 0 .cse2) (= .cse2 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256)))) (or (<= .cse2 127) (= .cse2 .cse3)))) (< 127 .cse4)) (let ((.cse5 (mod (+ .cse4 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (= 0 .cse5) (<= .cse4 127) (let ((.cse6 (mod (+ .cse5 .cse7) 256))) (and (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse6 (- 256))) 256))) (= .cse6 .cse3) (<= .cse6 127)) (or (= 0 .cse6) (< 127 .cse6) (= .cse6 |c_ULTIMATE.start_main_~y~0#1|))))))))) (or .cse1 (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse8 (mod .cse9 256))) (and (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse8 (- 256))) 256))) (= .cse8 .cse3) (<= .cse8 127)) (or (< 127 .cse8) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256))) (= 0 .cse8) (= .cse8 |c_ULTIMATE.start_main_~y~0#1|))))) (or (= 0 .cse9) (let ((.cse10 (mod (+ .cse7 .cse9) 256))) (and (or (= 0 .cse10) (= .cse10 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256))) (< 127 .cse10)) (or (= .cse10 .cse3) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse10 (- 256))) 256))) (<= .cse10 127)))) .cse0)))) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 128)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (or .cse0 (= 0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (let ((.cse12 (mod (* |c_ULTIMATE.start_main_~x~0#1| 255) 256))) (and (let ((.cse11 (mod (mod .cse12 |c_ULTIMATE.start_main_~y~0#1|) 256))) (or (not (= 0 (mod (mod |c_ULTIMATE.start_main_~y~0#1| .cse11) 256))) (= 0 .cse11) (< 127 .cse12))) (let ((.cse13 (mod (+ .cse12 (- 256)) |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (mod (mod |c_ULTIMATE.start_main_~y~0#1| (+ (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 255) .cse13) 256) (- 256))) 256))) (<= .cse12 127) (= 0 .cse13))))) (<= |c_ULTIMATE.start_main_~y~0#1| 0) (not (= 0 (mod |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (<= 0 |c_ULTIMATE.start_main_~x~0#1|)) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main_~y~0#1|))) is different from false [2021-12-17 02:40:07,509 WARN L227 SmtUtils]: Spent 47.31s on a formula simplification. DAG size of input: 79 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:40:09,515 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse7 (+ |c_ULTIMATE.start_main_~y~0#1| 256)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse11 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse1 (or .cse10 (= .cse11 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse11) 256))) (= 0 .cse11))) (.cse3 (< 127 .cse11)) (.cse5 (<= .cse11 127)) (.cse4 (or .cse10 (= .cse11 .cse7) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse11 (- 256))) 256))))) (.cse6 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse2 (or (= .cse6 .cse7) .cse8 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse6 (- 256))) 256)))))) (and (or (and .cse1 .cse2) .cse3) (or (and .cse2 .cse4) .cse5))) (<= .cse6 127)) (or (let ((.cse9 (or (= 0 .cse6) (= .cse6 |c_ULTIMATE.start_main_~y~0#1|) .cse8 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse6) 256)))))) (and (or (and .cse1 .cse9) .cse3) (or .cse5 (and .cse9 .cse4)))) (< 127 .cse6)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse15 (mod .cse0 256))) (and (or (let ((.cse12 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256)))) (.cse13 (= 0 .cse15)) (.cse14 (= .cse15 |c_ULTIMATE.start_main_~y~0#1|))) (and (or .cse12 .cse13 .cse14) (or .cse10 .cse12 .cse13 .cse14))) (< 127 .cse15)) (or (let ((.cse16 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse15 (- 256))) 256)))) (.cse17 (= .cse15 .cse7))) (and (or .cse16 .cse17 .cse8) (or .cse16 .cse17 .cse10))) (<= .cse15 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (let ((.cse18 (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256))) (or (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse18) (< 127 .cse18)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse18) (<= .cse18 127)))) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main_~y~0#1|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main_~y~0#1|))) is different from false [2021-12-17 02:40:11,520 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse7 (+ |c_ULTIMATE.start_main_~y~0#1| 256)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse11 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse1 (or .cse10 (= .cse11 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse11) 256))) (= 0 .cse11))) (.cse3 (< 127 .cse11)) (.cse5 (<= .cse11 127)) (.cse4 (or .cse10 (= .cse11 .cse7) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse11 (- 256))) 256))))) (.cse6 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse2 (or (= .cse6 .cse7) .cse8 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse6 (- 256))) 256)))))) (and (or (and .cse1 .cse2) .cse3) (or (and .cse2 .cse4) .cse5))) (<= .cse6 127)) (or (let ((.cse9 (or (= 0 .cse6) (= .cse6 |c_ULTIMATE.start_main_~y~0#1|) .cse8 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse6) 256)))))) (and (or (and .cse1 .cse9) .cse3) (or .cse5 (and .cse9 .cse4)))) (< 127 .cse6)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse15 (mod .cse0 256))) (and (or (let ((.cse12 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256)))) (.cse13 (= 0 .cse15)) (.cse14 (= .cse15 |c_ULTIMATE.start_main_~y~0#1|))) (and (or .cse12 .cse13 .cse14) (or .cse10 .cse12 .cse13 .cse14))) (< 127 .cse15)) (or (let ((.cse16 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse15 (- 256))) 256)))) (.cse17 (= .cse15 .cse7))) (and (or .cse16 .cse17 .cse8) (or .cse16 .cse17 .cse10))) (<= .cse15 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (let ((.cse18 (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256))) (or (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse18) (< 127 .cse18)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse18) (<= .cse18 127)))) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main_~y~0#1|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main_~y~0#1|))) is different from true [2021-12-17 02:40:49,228 WARN L227 SmtUtils]: Spent 31.21s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:40:51,234 WARN L838 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main_~y~0#1|) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main_~y~0#1|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 02:40:53,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 02:40:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:40:53,336 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2021-12-17 02:40:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:40:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 12 [2021-12-17 02:40:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:40:53,337 INFO L225 Difference]: With dead ends: 22 [2021-12-17 02:40:53,337 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 02:40:53,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 255.3s TimeCoverageRelationStatistics Valid=70, Invalid=207, Unknown=31, NotChecked=342, Total=650 [2021-12-17 02:40:53,338 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:40:53,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 1 Unknown, 36 Unchecked, 2.2s Time] [2021-12-17 02:40:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 02:40:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-12-17 02:40:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-12-17 02:40:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-12-17 02:40:53,340 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2021-12-17 02:40:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:40:53,340 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-12-17 02:40:53,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-12-17 02:40:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-12-17 02:40:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 02:40:53,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:40:53,341 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:40:53,349 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-12-17 02:40:53,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:40:53,543 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:40:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:40:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2096200307, now seen corresponding path program 1 times [2021-12-17 02:40:53,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:40:53,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001179455] [2021-12-17 02:40:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:40:53,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:40:53,554 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:40:53,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073676936] [2021-12-17 02:40:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:40:53,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:40:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:40:53,575 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-12-17 02:40:53,579 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-12-17 02:40:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:40:53,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 02:40:53,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:40:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:40:54,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:41:21,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse0 (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_22|)) (.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse1 (mod .cse3 256))) (and (or (and .cse0 (< 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (+ .cse1 (- 256))) 256))) (<= .cse1 127)) (or (< 127 .cse1) (let ((.cse2 (= 0 .cse1))) (and (or .cse2 (< 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse1) 256))) (or .cse2 .cse0))))))) (or (= 0 .cse3) (let ((.cse12 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse13 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (let ((.cse4 (or .cse12 (and (< 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse13) 256)) .cse0) (= 0 .cse13))) (.cse6 (< 127 .cse13)) (.cse7 (<= .cse13 127)) (.cse8 (or .cse12 (and (< 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (+ .cse13 (- 256))) 256)) .cse0))) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse3) 256))) (and (or (let ((.cse5 (or (< 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (+ .cse9 (- 256))) 256)) .cse10))) (and (or (and .cse4 .cse5) .cse6) (or .cse7 (and .cse8 .cse5)))) (<= .cse9 127)) (or (let ((.cse11 (or (< 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse9) 256)) (= 0 .cse9) .cse10))) (and (or (and .cse4 .cse11) .cse6) (or .cse7 (and .cse8 .cse11)))) (< 127 .cse9))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)))))) is different from false [2021-12-17 02:41:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 02:41:43,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:41:43,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001179455] [2021-12-17 02:41:43,015 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 02:41:43,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073676936] [2021-12-17 02:41:43,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073676936] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:41:43,015 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:41:43,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-12-17 02:41:43,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044218266] [2021-12-17 02:41:43,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:41:43,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 02:41:43,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:41:43,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 02:41:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2021-12-17 02:41:43,016 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-12-17 02:41:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:41:43,254 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2021-12-17 02:41:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:41:43,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 12 [2021-12-17 02:41:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:41:43,255 INFO L225 Difference]: With dead ends: 23 [2021-12-17 02:41:43,255 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 02:41:43,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2021-12-17 02:41:43,256 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:41:43,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2021-12-17 02:41:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 02:41:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 02:41:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-12-17 02:41:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-12-17 02:41:43,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-12-17 02:41:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:41:43,259 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-12-17 02:41:43,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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-12-17 02:41:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-12-17 02:41:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 02:41:43,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:41:43,259 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:41:43,277 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-12-17 02:41:43,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:41:43,465 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:41:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:41:43,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1002381772, now seen corresponding path program 3 times [2021-12-17 02:41:43,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:41:43,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999028975] [2021-12-17 02:41:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:41:43,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:41:43,470 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 02:41:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508068908] [2021-12-17 02:41:43,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:41:43,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:41:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:41:43,478 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-12-17 02:41:43,479 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-12-17 02:41:58,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 02:41:58,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:41:58,961 WARN L261 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-17 02:41:58,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:43:32,021 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main_~y~0#1| .cse0) 256)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_main_~y~0#1|)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128)))))) is different from false [2021-12-17 02:44:45,649 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |c_ULTIMATE.start_main_~y~0#1| .cse0) 256)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_main_~y~0#1|)) (not (= 0 .cse0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0)))) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 02:45:04,172 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |c_ULTIMATE.start_main_~y~0#1| .cse0) 256)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_main_~y~0#1|)) (= 0 (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= 0 .cse0)) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128))))) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 02:45:27,660 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_main_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse1 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |c_ULTIMATE.start_main_~y~0#1|) 256))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main_~y~0#1| .cse1) 256))) (and (= |c_ULTIMATE.start_gcd_test_#res#1| .cse0) (= 0 (mod (mod .cse1 .cse0) 256)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |c_ULTIMATE.start_main_~y~0#1|)) (not (= 0 .cse0)) (not (= 0 .cse1)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0)))))) is different from false Killed by 15