/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 05:43:09,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 05:43:09,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 05:43:09,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 05:43:09,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 05:43:09,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 05:43:09,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 05:43:09,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 05:43:09,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 05:43:09,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 05:43:09,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 05:43:09,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 05:43:09,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 05:43:09,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 05:43:09,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 05:43:09,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 05:43:09,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 05:43:09,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 05:43:09,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 05:43:09,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 05:43:09,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 05:43:09,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 05:43:09,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 05:43:09,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 05:43:09,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 05:43:09,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 05:43:09,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 05:43:09,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 05:43:09,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 05:43:09,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 05:43:09,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 05:43:09,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 05:43:09,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 05:43:09,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 05:43:09,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 05:43:09,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 05:43:09,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 05:43:09,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 05:43:09,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 05:43:09,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 05:43:09,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 05:43:09,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 05:43:09,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 05:43:09,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 05:43:09,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 05:43:09,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 05:43:09,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 05:43:09,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 05:43:09,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 05:43:09,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 05:43:09,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 05:43:09,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 05:43:09,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 05:43:09,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 05:43:09,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 05:43:09,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 05:43:09,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 05:43:09,412 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 05:43:09,412 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 05:43:09,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 05:43:09,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 05:43:09,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 05:43:09,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 05:43:09,644 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 05:43:09,646 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-03-20 05:43:09,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69446b901/1b0ed997be504585ade4105bba203c5e/FLAG1f4f68a65 [2022-03-20 05:43:10,036 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 05:43:10,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-03-20 05:43:10,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69446b901/1b0ed997be504585ade4105bba203c5e/FLAG1f4f68a65 [2022-03-20 05:43:10,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69446b901/1b0ed997be504585ade4105bba203c5e [2022-03-20 05:43:10,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 05:43:10,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 05:43:10,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 05:43:10,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 05:43:10,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 05:43:10,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6ee665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10, skipping insertion in model container [2022-03-20 05:43:10,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 05:43:10,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 05:43:10,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c[490,503] [2022-03-20 05:43:10,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 05:43:10,288 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 05:43:10,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c[490,503] [2022-03-20 05:43:10,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 05:43:10,321 INFO L208 MainTranslator]: Completed translation [2022-03-20 05:43:10,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10 WrapperNode [2022-03-20 05:43:10,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 05:43:10,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 05:43:10,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 05:43:10,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 05:43:10,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 05:43:10,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 05:43:10,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 05:43:10,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 05:43:10,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 05:43:10,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:10,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 05:43:10,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 05:43:10,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 05:43:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 05:43:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 05:43:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 05:43:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 05:43:10,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 05:43:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 05:43:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 05:43:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 05:43:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 05:43:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 05:43:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 05:43:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 05:43:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 05:43:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 05:43:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 05:43:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 05:43:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 05:43:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 05:43:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 05:43:10,509 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 05:43:10,511 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 05:43:10,726 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 05:43:10,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 05:43:10,730 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-20 05:43:10,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:43:10 BoogieIcfgContainer [2022-03-20 05:43:10,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 05:43:10,732 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 05:43:10,732 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 05:43:10,733 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 05:43:10,736 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:43:10" (1/1) ... [2022-03-20 05:43:10,749 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 05:43:10,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 05:43:10 BasicIcfg [2022-03-20 05:43:10,767 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 05:43:10,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 05:43:10,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 05:43:10,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 05:43:10,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 05:43:10" (1/4) ... [2022-03-20 05:43:10,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec8adb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:43:10, skipping insertion in model container [2022-03-20 05:43:10,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:43:10" (2/4) ... [2022-03-20 05:43:10,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec8adb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:43:10, skipping insertion in model container [2022-03-20 05:43:10,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:43:10" (3/4) ... [2022-03-20 05:43:10,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec8adb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 05:43:10, skipping insertion in model container [2022-03-20 05:43:10,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 05:43:10" (4/4) ... [2022-03-20 05:43:10,776 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.cJordan [2022-03-20 05:43:10,781 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 05:43:10,781 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 05:43:10,824 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 05:43:10,830 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 05:43:10,830 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 05:43:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-03-20 05:43:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 05:43:10,853 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:10,853 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:10,854 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:10,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-03-20 05:43:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:10,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571622449] [2022-03-20 05:43:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:11,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 05:43:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:11,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 05:43:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-03-20 05:43:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:11,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:11,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571622449] [2022-03-20 05:43:11,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571622449] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:11,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:11,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 05:43:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347158076] [2022-03-20 05:43:11,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:11,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 05:43:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 05:43:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 05:43:11,185 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:11,265 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-03-20 05:43:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 05:43:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-03-20 05:43:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:11,273 INFO L225 Difference]: With dead ends: 41 [2022-03-20 05:43:11,273 INFO L226 Difference]: Without dead ends: 36 [2022-03-20 05:43:11,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 05:43:11,278 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:11,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-20 05:43:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-03-20 05:43:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-20 05:43:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-03-20 05:43:11,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-03-20 05:43:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:11,306 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-03-20 05:43:11,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-03-20 05:43:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 05:43:11,308 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:11,308 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:11,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 05:43:11,309 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-03-20 05:43:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:11,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800786040] [2022-03-20 05:43:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:11,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:11,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090790874] [2022-03-20 05:43:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:11,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:11,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:11,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 05:43:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:11,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 05:43:11,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:11,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:11,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800786040] [2022-03-20 05:43:11,563 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:11,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090790874] [2022-03-20 05:43:11,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090790874] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:11,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:11,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 05:43:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722311581] [2022-03-20 05:43:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:11,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 05:43:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 05:43:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 05:43:11,567 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:11,584 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-03-20 05:43:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 05:43:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-03-20 05:43:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:11,589 INFO L225 Difference]: With dead ends: 37 [2022-03-20 05:43:11,591 INFO L226 Difference]: Without dead ends: 37 [2022-03-20 05:43:11,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 05:43:11,592 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:11,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-20 05:43:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-03-20 05:43:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-20 05:43:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-03-20 05:43:11,597 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-03-20 05:43:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:11,598 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-03-20 05:43:11,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-03-20 05:43:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 05:43:11,601 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:11,601 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:11,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-20 05:43:11,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:11,826 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-03-20 05:43:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170167580] [2022-03-20 05:43:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:11,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:11,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718698223] [2022-03-20 05:43:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:11,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:11,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 05:43:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:11,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 05:43:11,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 05:43:11,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:11,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170167580] [2022-03-20 05:43:11,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:11,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718698223] [2022-03-20 05:43:11,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718698223] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:11,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:11,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 05:43:11,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42238182] [2022-03-20 05:43:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:11,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 05:43:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 05:43:11,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:43:11,953 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 05:43:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:11,994 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-03-20 05:43:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 05:43:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-03-20 05:43:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:11,995 INFO L225 Difference]: With dead ends: 50 [2022-03-20 05:43:11,996 INFO L226 Difference]: Without dead ends: 50 [2022-03-20 05:43:12,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 05:43:12,006 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:12,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 169 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-20 05:43:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-03-20 05:43:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-20 05:43:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-03-20 05:43:12,012 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-03-20 05:43:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:12,012 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-03-20 05:43:12,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 05:43:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-03-20 05:43:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-20 05:43:12,013 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:12,013 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:12,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:12,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-20 05:43:12,230 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:12,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-03-20 05:43:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:12,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987662858] [2022-03-20 05:43:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:12,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:12,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630752197] [2022-03-20 05:43:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:12,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:12,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:12,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 05:43:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 05:43:12,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:12,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:12,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987662858] [2022-03-20 05:43:12,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:12,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630752197] [2022-03-20 05:43:12,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630752197] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:12,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:12,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 05:43:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899339859] [2022-03-20 05:43:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:12,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 05:43:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 05:43:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 05:43:12,339 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:12,355 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-03-20 05:43:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 05:43:12,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-03-20 05:43:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:12,356 INFO L225 Difference]: With dead ends: 40 [2022-03-20 05:43:12,356 INFO L226 Difference]: Without dead ends: 40 [2022-03-20 05:43:12,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 05:43:12,357 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:12,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-20 05:43:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-20 05:43:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-20 05:43:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-03-20 05:43:12,361 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-03-20 05:43:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:12,361 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-03-20 05:43:12,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-03-20 05:43:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-20 05:43:12,362 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:12,362 INFO L499 BasicCegarLoop]: trace histogram [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, 1] [2022-03-20 05:43:12,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:12,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:12,580 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:12,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-03-20 05:43:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:12,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123407173] [2022-03-20 05:43:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:12,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:12,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227860184] [2022-03-20 05:43:12,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:12,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:12,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-20 05:43:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:12,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-20 05:43:12,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 05:43:12,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:12,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123407173] [2022-03-20 05:43:12,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:12,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227860184] [2022-03-20 05:43:12,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227860184] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:12,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:12,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 05:43:12,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718736090] [2022-03-20 05:43:12,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:12,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 05:43:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 05:43:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 05:43:12,819 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 05:43:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:12,948 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-03-20 05:43:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 05:43:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-03-20 05:43:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:12,949 INFO L225 Difference]: With dead ends: 66 [2022-03-20 05:43:12,949 INFO L226 Difference]: Without dead ends: 66 [2022-03-20 05:43:12,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-03-20 05:43:12,950 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:12,950 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 290 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-20 05:43:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-03-20 05:43:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-03-20 05:43:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-03-20 05:43:12,955 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-03-20 05:43:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:12,955 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-03-20 05:43:12,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 05:43:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-03-20 05:43:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-20 05:43:12,956 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:12,957 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-03-20 05:43:12,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:13,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:13,173 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-03-20 05:43:13,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:13,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241911129] [2022-03-20 05:43:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:13,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:13,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:13,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120963119] [2022-03-20 05:43:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:13,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:13,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-20 05:43:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 05:43:13,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:13,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:13,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:13,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241911129] [2022-03-20 05:43:13,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:13,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120963119] [2022-03-20 05:43:13,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120963119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:13,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:13,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-20 05:43:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966139197] [2022-03-20 05:43:13,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:13,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 05:43:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 05:43:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-20 05:43:13,388 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-20 05:43:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:13,490 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-03-20 05:43:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 05:43:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-03-20 05:43:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:13,491 INFO L225 Difference]: With dead ends: 144 [2022-03-20 05:43:13,491 INFO L226 Difference]: Without dead ends: 144 [2022-03-20 05:43:13,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-03-20 05:43:13,492 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:13,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 286 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-20 05:43:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-03-20 05:43:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-03-20 05:43:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-03-20 05:43:13,500 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-03-20 05:43:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:13,500 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-03-20 05:43:13,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-20 05:43:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-03-20 05:43:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 05:43:13,501 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:13,501 INFO L499 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] [2022-03-20 05:43:13,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:13,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:13,720 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-03-20 05:43:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:13,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879519741] [2022-03-20 05:43:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:13,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:13,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346501836] [2022-03-20 05:43:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:13,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:13,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:13,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:13,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 05:43:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:13,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 05:43:13,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 05:43:13,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 05:43:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:14,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879519741] [2022-03-20 05:43:14,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:14,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346501836] [2022-03-20 05:43:14,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346501836] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:14,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:14,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-20 05:43:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404739383] [2022-03-20 05:43:14,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:14,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 05:43:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 05:43:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 05:43:14,029 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:14,165 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-03-20 05:43:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 05:43:14,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-03-20 05:43:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:14,168 INFO L225 Difference]: With dead ends: 175 [2022-03-20 05:43:14,168 INFO L226 Difference]: Without dead ends: 175 [2022-03-20 05:43:14,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-20 05:43:14,170 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 115 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:14,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 301 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-03-20 05:43:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-03-20 05:43:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-20 05:43:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-03-20 05:43:14,190 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-03-20 05:43:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:14,190 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-03-20 05:43:14,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-03-20 05:43:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-20 05:43:14,191 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:14,191 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-03-20 05:43:14,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:14,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:14,408 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-03-20 05:43:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:14,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409434505] [2022-03-20 05:43:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:14,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661323995] [2022-03-20 05:43:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:14,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:14,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:14,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:14,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 05:43:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:14,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-20 05:43:14,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 05:43:14,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:14,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409434505] [2022-03-20 05:43:14,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:14,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661323995] [2022-03-20 05:43:14,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661323995] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:14,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:14,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 05:43:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232065080] [2022-03-20 05:43:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:14,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 05:43:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 05:43:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-20 05:43:14,703 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 05:43:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:14,815 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-03-20 05:43:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 05:43:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-03-20 05:43:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:14,818 INFO L225 Difference]: With dead ends: 155 [2022-03-20 05:43:14,818 INFO L226 Difference]: Without dead ends: 155 [2022-03-20 05:43:14,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-20 05:43:14,818 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 88 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:14,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 249 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-03-20 05:43:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-03-20 05:43:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-03-20 05:43:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-03-20 05:43:14,842 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-03-20 05:43:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:14,842 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-03-20 05:43:14,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 05:43:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-03-20 05:43:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-20 05:43:14,843 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:14,844 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-03-20 05:43:14,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:15,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:15,062 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-03-20 05:43:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:15,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313493630] [2022-03-20 05:43:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:15,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:15,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857843291] [2022-03-20 05:43:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:15,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:43:15,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 05:43:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:15,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-20 05:43:15,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 05:43:15,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:15,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313493630] [2022-03-20 05:43:15,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857843291] [2022-03-20 05:43:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857843291] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:15,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-03-20 05:43:15,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61285336] [2022-03-20 05:43:15,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:15,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 05:43:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:15,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 05:43:15,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-20 05:43:15,391 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 05:43:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:15,494 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-03-20 05:43:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 05:43:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-03-20 05:43:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:15,497 INFO L225 Difference]: With dead ends: 177 [2022-03-20 05:43:15,497 INFO L226 Difference]: Without dead ends: 177 [2022-03-20 05:43:15,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-03-20 05:43:15,498 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 61 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:15,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 432 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-03-20 05:43:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-03-20 05:43:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-03-20 05:43:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-03-20 05:43:15,507 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-03-20 05:43:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:15,507 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-03-20 05:43:15,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 05:43:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-03-20 05:43:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-20 05:43:15,511 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:15,511 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-03-20 05:43:15,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-20 05:43:15,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-03-20 05:43:15,732 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-03-20 05:43:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:15,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782449152] [2022-03-20 05:43:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:15,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:15,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348817625] [2022-03-20 05:43:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:15,760 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) [2022-03-20 05:43:15,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-20 05:43:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:15,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 05:43:15,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:15,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782449152] [2022-03-20 05:43:15,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:15,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348817625] [2022-03-20 05:43:15,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348817625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:15,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:15,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 05:43:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063657975] [2022-03-20 05:43:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:15,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 05:43:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 05:43:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:43:15,861 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:15,876 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-03-20 05:43:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 05:43:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-03-20 05:43:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:15,878 INFO L225 Difference]: With dead ends: 174 [2022-03-20 05:43:15,878 INFO L226 Difference]: Without dead ends: 174 [2022-03-20 05:43:15,878 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:43:15,878 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:15,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-20 05:43:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-03-20 05:43:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-03-20 05:43:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-03-20 05:43:15,883 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-03-20 05:43:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:15,883 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-03-20 05:43:15,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 05:43:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-03-20 05:43:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 05:43:15,884 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:15,884 INFO L499 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2022-03-20 05:43:15,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:16,100 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-20 05:43:16,101 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-03-20 05:43:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:16,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626233111] [2022-03-20 05:43:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:16,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:16,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949932528] [2022-03-20 05:43:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:16,110 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) [2022-03-20 05:43:16,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-20 05:43:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:16,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 05:43:16,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-20 05:43:16,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:16,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:16,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626233111] [2022-03-20 05:43:16,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:16,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949932528] [2022-03-20 05:43:16,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949932528] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:16,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:16,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 05:43:16,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382198316] [2022-03-20 05:43:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:16,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 05:43:16,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 05:43:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 05:43:16,213 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 05:43:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:16,260 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-03-20 05:43:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 05:43:16,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-03-20 05:43:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:16,261 INFO L225 Difference]: With dead ends: 237 [2022-03-20 05:43:16,261 INFO L226 Difference]: Without dead ends: 237 [2022-03-20 05:43:16,261 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:43:16,262 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:16,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 155 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-20 05:43:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-03-20 05:43:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-03-20 05:43:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-03-20 05:43:16,268 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-03-20 05:43:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:16,268 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-03-20 05:43:16,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 05:43:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-03-20 05:43:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 05:43:16,269 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:16,269 INFO L499 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, 1, 1] [2022-03-20 05:43:16,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:16,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-20 05:43:16,479 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-03-20 05:43:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091057994] [2022-03-20 05:43:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:16,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:16,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114662140] [2022-03-20 05:43:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:16,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:16,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:16,515 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) [2022-03-20 05:43:16,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-20 05:43:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:16,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-20 05:43:16,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:16,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:16,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091057994] [2022-03-20 05:43:16,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114662140] [2022-03-20 05:43:16,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114662140] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:16,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:16,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-03-20 05:43:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064091814] [2022-03-20 05:43:16,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:16,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 05:43:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 05:43:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-20 05:43:16,993 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 05:43:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:17,741 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-03-20 05:43:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 05:43:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-03-20 05:43:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:17,743 INFO L225 Difference]: With dead ends: 390 [2022-03-20 05:43:17,743 INFO L226 Difference]: Without dead ends: 390 [2022-03-20 05:43:17,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-03-20 05:43:17,743 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 152 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:17,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 438 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 05:43:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-03-20 05:43:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-03-20 05:43:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-03-20 05:43:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-03-20 05:43:17,754 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-03-20 05:43:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:17,754 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-03-20 05:43:17,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 05:43:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-03-20 05:43:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 05:43:17,755 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:17,755 INFO L499 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:17,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:17,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-20 05:43:17,971 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-03-20 05:43:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:17,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646294811] [2022-03-20 05:43:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:17,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:17,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23394802] [2022-03-20 05:43:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:17,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:17,987 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) [2022-03-20 05:43:17,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 05:43:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:18,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 05:43:18,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 05:43:18,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646294811] [2022-03-20 05:43:18,109 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:18,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23394802] [2022-03-20 05:43:18,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23394802] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:18,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:18,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 05:43:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652003403] [2022-03-20 05:43:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:18,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 05:43:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 05:43:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 05:43:18,110 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 05:43:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:18,141 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-03-20 05:43:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 05:43:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-03-20 05:43:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:18,143 INFO L225 Difference]: With dead ends: 564 [2022-03-20 05:43:18,143 INFO L226 Difference]: Without dead ends: 564 [2022-03-20 05:43:18,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:43:18,144 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:18,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-03-20 05:43:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-03-20 05:43:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-03-20 05:43:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-03-20 05:43:18,164 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-03-20 05:43:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:18,164 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-03-20 05:43:18,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 05:43:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-03-20 05:43:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 05:43:18,165 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:18,165 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:18,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:18,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 05:43:18,383 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-03-20 05:43:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:18,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472959183] [2022-03-20 05:43:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:18,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:18,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197093815] [2022-03-20 05:43:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:18,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:18,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:18,405 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) [2022-03-20 05:43:18,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 05:43:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:18,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 05:43:18,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-20 05:43:18,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-20 05:43:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:18,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472959183] [2022-03-20 05:43:18,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:18,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197093815] [2022-03-20 05:43:18,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197093815] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:18,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:18,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-03-20 05:43:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114744901] [2022-03-20 05:43:18,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:18,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 05:43:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 05:43:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-03-20 05:43:18,607 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-20 05:43:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:18,736 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-03-20 05:43:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 05:43:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-03-20 05:43:18,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:18,740 INFO L225 Difference]: With dead ends: 770 [2022-03-20 05:43:18,740 INFO L226 Difference]: Without dead ends: 770 [2022-03-20 05:43:18,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-03-20 05:43:18,741 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 158 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:18,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 272 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-03-20 05:43:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-03-20 05:43:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-03-20 05:43:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-03-20 05:43:18,769 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-03-20 05:43:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:18,769 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-03-20 05:43:18,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-20 05:43:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-03-20 05:43:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 05:43:18,770 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:18,770 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-03-20 05:43:18,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:18,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-20 05:43:18,987 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:18,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 841576990, now seen corresponding path program 1 times [2022-03-20 05:43:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:18,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610507786] [2022-03-20 05:43:18,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:18,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:18,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1839567083] [2022-03-20 05:43:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:18,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:18,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:19,001 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) [2022-03-20 05:43:19,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 05:43:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:19,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 05:43:19,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:19,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 05:43:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:19,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610507786] [2022-03-20 05:43:19,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:19,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839567083] [2022-03-20 05:43:19,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839567083] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:19,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:19,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-03-20 05:43:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036780919] [2022-03-20 05:43:19,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:19,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 05:43:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 05:43:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-03-20 05:43:19,261 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-20 05:43:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:19,450 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-03-20 05:43:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-20 05:43:19,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-03-20 05:43:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:19,455 INFO L225 Difference]: With dead ends: 1119 [2022-03-20 05:43:19,455 INFO L226 Difference]: Without dead ends: 1119 [2022-03-20 05:43:19,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-03-20 05:43:19,455 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 222 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:19,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 416 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:43:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-03-20 05:43:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-03-20 05:43:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-03-20 05:43:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-03-20 05:43:19,478 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-03-20 05:43:19,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:19,479 INFO L478 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-03-20 05:43:19,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-03-20 05:43:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-03-20 05:43:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 05:43:19,479 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:19,479 INFO L499 BasicCegarLoop]: trace histogram [4, 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] [2022-03-20 05:43:19,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:19,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:19,698 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash -799775801, now seen corresponding path program 2 times [2022-03-20 05:43:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:19,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63626651] [2022-03-20 05:43:19,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:19,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:19,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278934078] [2022-03-20 05:43:19,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:43:19,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:19,705 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) [2022-03-20 05:43:19,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-20 05:43:19,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:43:19,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:43:19,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 05:43:19,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-20 05:43:19,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:19,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63626651] [2022-03-20 05:43:19,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:19,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278934078] [2022-03-20 05:43:19,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278934078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:19,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:19,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 05:43:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968873107] [2022-03-20 05:43:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:19,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 05:43:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 05:43:19,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 05:43:19,804 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 05:43:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:19,862 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-03-20 05:43:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 05:43:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-03-20 05:43:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:19,866 INFO L225 Difference]: With dead ends: 1234 [2022-03-20 05:43:19,867 INFO L226 Difference]: Without dead ends: 1234 [2022-03-20 05:43:19,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-20 05:43:19,867 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:19,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 195 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-20 05:43:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-03-20 05:43:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-03-20 05:43:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-03-20 05:43:19,893 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-03-20 05:43:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:19,893 INFO L478 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-03-20 05:43:19,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 05:43:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-03-20 05:43:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 05:43:19,894 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:19,894 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:19,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:20,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-20 05:43:20,108 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:20,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:20,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-03-20 05:43:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:20,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569392825] [2022-03-20 05:43:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:20,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:20,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:20,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397729877] [2022-03-20 05:43:20,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:20,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:20,115 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) [2022-03-20 05:43:20,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-20 05:43:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:20,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-20 05:43:20,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 05:43:20,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 05:43:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569392825] [2022-03-20 05:43:21,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397729877] [2022-03-20 05:43:21,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397729877] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:21,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:21,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-03-20 05:43:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036886000] [2022-03-20 05:43:21,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:21,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 05:43:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 05:43:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-03-20 05:43:21,483 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-03-20 05:43:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:27,788 INFO L93 Difference]: Finished difference Result 1410 states and 2007 transitions. [2022-03-20 05:43:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-20 05:43:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-03-20 05:43:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:27,793 INFO L225 Difference]: With dead ends: 1410 [2022-03-20 05:43:27,793 INFO L226 Difference]: Without dead ends: 1404 [2022-03-20 05:43:27,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-03-20 05:43:27,793 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 175 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:27,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 644 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-03-20 05:43:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-03-20 05:43:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-03-20 05:43:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-03-20 05:43:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-03-20 05:43:27,824 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-03-20 05:43:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:27,824 INFO L478 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-03-20 05:43:27,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-03-20 05:43:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-03-20 05:43:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 05:43:27,825 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:27,825 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:43:27,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:28,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-20 05:43:28,053 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:28,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1248898955, now seen corresponding path program 1 times [2022-03-20 05:43:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925057512] [2022-03-20 05:43:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:28,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:28,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1178779565] [2022-03-20 05:43:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:28,068 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) [2022-03-20 05:43:28,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-20 05:43:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:28,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-20 05:43:28,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 05:43:28,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-20 05:43:28,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:28,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925057512] [2022-03-20 05:43:28,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:28,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178779565] [2022-03-20 05:43:28,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178779565] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:28,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:28,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-20 05:43:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5522824] [2022-03-20 05:43:28,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:28,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 05:43:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:28,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 05:43:28,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-20 05:43:28,413 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-03-20 05:43:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:28,718 INFO L93 Difference]: Finished difference Result 2543 states and 3572 transitions. [2022-03-20 05:43:28,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-20 05:43:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-03-20 05:43:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:28,725 INFO L225 Difference]: With dead ends: 2543 [2022-03-20 05:43:28,726 INFO L226 Difference]: Without dead ends: 2543 [2022-03-20 05:43:28,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2022-03-20 05:43:28,726 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 370 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:28,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 510 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 05:43:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-03-20 05:43:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2406. [2022-03-20 05:43:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-03-20 05:43:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3425 transitions. [2022-03-20 05:43:28,775 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3425 transitions. Word has length 64 [2022-03-20 05:43:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:28,775 INFO L478 AbstractCegarLoop]: Abstraction has 2406 states and 3425 transitions. [2022-03-20 05:43:28,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-03-20 05:43:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3425 transitions. [2022-03-20 05:43:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-03-20 05:43:28,775 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:28,776 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 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] [2022-03-20 05:43:28,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:28,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-20 05:43:28,992 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash -934249537, now seen corresponding path program 1 times [2022-03-20 05:43:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:28,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669790493] [2022-03-20 05:43:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:28,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:28,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176358828] [2022-03-20 05:43:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:28,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:28,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:29,004 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) [2022-03-20 05:43:29,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-20 05:43:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:29,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-20 05:43:29,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-03-20 05:43:29,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-03-20 05:43:29,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:29,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669790493] [2022-03-20 05:43:29,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:29,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176358828] [2022-03-20 05:43:29,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176358828] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-20 05:43:29,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 05:43:29,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-03-20 05:43:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002410728] [2022-03-20 05:43:29,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:29,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 05:43:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:29,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 05:43:29,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-20 05:43:29,396 INFO L87 Difference]: Start difference. First operand 2406 states and 3425 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 05:43:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:29,430 INFO L93 Difference]: Finished difference Result 2465 states and 3473 transitions. [2022-03-20 05:43:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 05:43:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-03-20 05:43:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:29,438 INFO L225 Difference]: With dead ends: 2465 [2022-03-20 05:43:29,438 INFO L226 Difference]: Without dead ends: 2465 [2022-03-20 05:43:29,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-03-20 05:43:29,439 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:29,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-03-20 05:43:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2442. [2022-03-20 05:43:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-03-20 05:43:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3450 transitions. [2022-03-20 05:43:29,496 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3450 transitions. Word has length 67 [2022-03-20 05:43:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:29,496 INFO L478 AbstractCegarLoop]: Abstraction has 2442 states and 3450 transitions. [2022-03-20 05:43:29,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 05:43:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3450 transitions. [2022-03-20 05:43:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-20 05:43:29,499 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:29,499 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 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] [2022-03-20 05:43:29,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:29,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:29,716 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1422612783, now seen corresponding path program 1 times [2022-03-20 05:43:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:29,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265408511] [2022-03-20 05:43:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:29,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:29,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:29,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730836809] [2022-03-20 05:43:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:29,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:29,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:29,740 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) [2022-03-20 05:43:29,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-20 05:43:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:29,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-20 05:43:29,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-20 05:43:29,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:43:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265408511] [2022-03-20 05:43:29,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730836809] [2022-03-20 05:43:29,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730836809] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:43:29,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:43:29,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 05:43:29,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950585645] [2022-03-20 05:43:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:43:29,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 05:43:29,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 05:43:29,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 05:43:29,897 INFO L87 Difference]: Start difference. First operand 2442 states and 3450 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 05:43:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:29,938 INFO L93 Difference]: Finished difference Result 2578 states and 3563 transitions. [2022-03-20 05:43:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 05:43:29,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-03-20 05:43:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:29,945 INFO L225 Difference]: With dead ends: 2578 [2022-03-20 05:43:29,945 INFO L226 Difference]: Without dead ends: 2578 [2022-03-20 05:43:29,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:43:29,946 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:29,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:43:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-03-20 05:43:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2372. [2022-03-20 05:43:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-03-20 05:43:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3297 transitions. [2022-03-20 05:43:29,999 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3297 transitions. Word has length 73 [2022-03-20 05:43:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:29,999 INFO L478 AbstractCegarLoop]: Abstraction has 2372 states and 3297 transitions. [2022-03-20 05:43:29,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-03-20 05:43:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3297 transitions. [2022-03-20 05:43:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-03-20 05:43:30,001 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:30,001 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 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] [2022-03-20 05:43:30,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:30,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:30,219 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1662269742, now seen corresponding path program 2 times [2022-03-20 05:43:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:30,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554767211] [2022-03-20 05:43:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:30,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:30,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387044789] [2022-03-20 05:43:30,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:43:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:30,252 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) [2022-03-20 05:43:30,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-20 05:43:30,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:43:30,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:43:30,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-20 05:43:30,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-03-20 05:43:31,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-03-20 05:43:32,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:32,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554767211] [2022-03-20 05:43:32,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:32,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387044789] [2022-03-20 05:43:32,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387044789] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:32,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:32,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-03-20 05:43:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228703292] [2022-03-20 05:43:32,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:32,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-20 05:43:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-20 05:43:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-03-20 05:43:32,512 INFO L87 Difference]: Start difference. First operand 2372 states and 3297 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-03-20 05:43:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:43:41,651 INFO L93 Difference]: Finished difference Result 2867 states and 3884 transitions. [2022-03-20 05:43:41,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-20 05:43:41,652 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-03-20 05:43:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:43:41,660 INFO L225 Difference]: With dead ends: 2867 [2022-03-20 05:43:41,660 INFO L226 Difference]: Without dead ends: 2863 [2022-03-20 05:43:41,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-03-20 05:43:41,661 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 303 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:43:41,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 742 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-03-20 05:43:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-03-20 05:43:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2736. [2022-03-20 05:43:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-03-20 05:43:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3745 transitions. [2022-03-20 05:43:41,711 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3745 transitions. Word has length 75 [2022-03-20 05:43:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:43:41,711 INFO L478 AbstractCegarLoop]: Abstraction has 2736 states and 3745 transitions. [2022-03-20 05:43:41,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-03-20 05:43:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3745 transitions. [2022-03-20 05:43:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-20 05:43:41,712 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:43:41,712 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-20 05:43:41,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-20 05:43:41,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-03-20 05:43:41,927 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:43:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:43:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash 612727057, now seen corresponding path program 1 times [2022-03-20 05:43:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:43:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983649379] [2022-03-20 05:43:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:43:41,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:43:41,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029494539] [2022-03-20 05:43:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:43:41,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:43:41,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:43:41,935 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) [2022-03-20 05:43:41,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-20 05:43:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:43:41,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-03-20 05:43:41,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:43:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-03-20 05:43:43,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:43:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-03-20 05:43:49,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:43:49,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983649379] [2022-03-20 05:43:49,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:43:49,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029494539] [2022-03-20 05:43:49,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029494539] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:43:49,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:43:49,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-03-20 05:43:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944632229] [2022-03-20 05:43:49,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:43:49,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-20 05:43:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:43:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-20 05:43:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-03-20 05:43:49,844 INFO L87 Difference]: Start difference. First operand 2736 states and 3745 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-20 05:44:01,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:44:07,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:44:21,892 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 [] [2022-03-20 05:44:34,418 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 [] [2022-03-20 05:44:38,289 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 [] [2022-03-20 05:44:48,547 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 [] [2022-03-20 05:44:52,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:44:54,433 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 [] [2022-03-20 05:45:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:45:07,873 INFO L93 Difference]: Finished difference Result 3477 states and 4731 transitions. [2022-03-20 05:45:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-03-20 05:45:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-03-20 05:45:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:45:07,894 INFO L225 Difference]: With dead ends: 3477 [2022-03-20 05:45:07,894 INFO L226 Difference]: Without dead ends: 3448 [2022-03-20 05:45:07,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4109 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=1957, Invalid=9599, Unknown=0, NotChecked=0, Total=11556 [2022-03-20 05:45:07,897 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 383 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 497 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2022-03-20 05:45:07,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 1307 Invalid, 2194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 1690 Invalid, 7 Unknown, 0 Unchecked, 31.8s Time] [2022-03-20 05:45:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2022-03-20 05:45:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3094. [2022-03-20 05:45:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2229 states have (on average 1.2960969044414536) internal successors, (2889), 2276 states have internal predecessors, (2889), 689 states have call successors, (689), 177 states have call predecessors, (689), 175 states have return successors, (682), 640 states have call predecessors, (682), 682 states have call successors, (682) [2022-03-20 05:45:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4260 transitions. [2022-03-20 05:45:08,035 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4260 transitions. Word has length 88 [2022-03-20 05:45:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:45:08,035 INFO L478 AbstractCegarLoop]: Abstraction has 3094 states and 4260 transitions. [2022-03-20 05:45:08,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-20 05:45:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4260 transitions. [2022-03-20 05:45:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-20 05:45:08,038 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:45:08,038 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:45:08,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-20 05:45:08,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-20 05:45:08,257 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:45:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:45:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1189405093, now seen corresponding path program 3 times [2022-03-20 05:45:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:45:08,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267235382] [2022-03-20 05:45:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:45:08,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:45:08,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088337775] [2022-03-20 05:45:08,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 05:45:08,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:08,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:45:08,272 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) [2022-03-20 05:45:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-20 05:45:08,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 05:45:08,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:45:08,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-20 05:45:08,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:45:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-03-20 05:45:08,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:45:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-03-20 05:45:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:45:09,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267235382] [2022-03-20 05:45:09,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:45:09,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088337775] [2022-03-20 05:45:09,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088337775] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:45:09,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:45:09,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-03-20 05:45:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263643783] [2022-03-20 05:45:09,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:45:09,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 05:45:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:45:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 05:45:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-03-20 05:45:09,107 INFO L87 Difference]: Start difference. First operand 3094 states and 4260 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-03-20 05:45:12,434 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 [] [2022-03-20 05:45:14,438 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 [] [2022-03-20 05:45:16,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:45:17,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:45:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:45:17,604 INFO L93 Difference]: Finished difference Result 3289 states and 4528 transitions. [2022-03-20 05:45:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 05:45:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-03-20 05:45:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:45:17,613 INFO L225 Difference]: With dead ends: 3289 [2022-03-20 05:45:17,613 INFO L226 Difference]: Without dead ends: 3279 [2022-03-20 05:45:17,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-03-20 05:45:17,614 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 129 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:45:17,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 632 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 471 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-03-20 05:45:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-03-20 05:45:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3021. [2022-03-20 05:45:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 2161 states have (on average 1.2952336881073576) internal successors, (2799), 2203 states have internal predecessors, (2799), 684 states have call successors, (684), 177 states have call predecessors, (684), 175 states have return successors, (682), 640 states have call predecessors, (682), 682 states have call successors, (682) [2022-03-20 05:45:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 4165 transitions. [2022-03-20 05:45:17,656 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 4165 transitions. Word has length 97 [2022-03-20 05:45:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:45:17,656 INFO L478 AbstractCegarLoop]: Abstraction has 3021 states and 4165 transitions. [2022-03-20 05:45:17,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-03-20 05:45:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4165 transitions. [2022-03-20 05:45:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-20 05:45:17,657 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:45:17,657 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-20 05:45:17,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-20 05:45:17,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:17,874 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:45:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:45:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1037830812, now seen corresponding path program 1 times [2022-03-20 05:45:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:45:17,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251097234] [2022-03-20 05:45:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:45:17,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:45:17,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131035161] [2022-03-20 05:45:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:17,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:45:17,883 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) [2022-03-20 05:45:17,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-20 05:45:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:45:17,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-20 05:45:17,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:45:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 05:45:18,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:45:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-03-20 05:45:18,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:45:18,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251097234] [2022-03-20 05:45:18,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:45:18,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131035161] [2022-03-20 05:45:18,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131035161] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:45:18,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:45:18,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-03-20 05:45:18,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35942425] [2022-03-20 05:45:18,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:45:18,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 05:45:18,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:45:18,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 05:45:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-03-20 05:45:18,369 INFO L87 Difference]: Start difference. First operand 3021 states and 4165 transitions. Second operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-20 05:45:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:45:18,928 INFO L93 Difference]: Finished difference Result 5645 states and 7820 transitions. [2022-03-20 05:45:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-20 05:45:18,928 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-03-20 05:45:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:45:18,943 INFO L225 Difference]: With dead ends: 5645 [2022-03-20 05:45:18,943 INFO L226 Difference]: Without dead ends: 5645 [2022-03-20 05:45:18,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=585, Invalid=1055, Unknown=0, NotChecked=0, Total=1640 [2022-03-20 05:45:18,944 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 619 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 05:45:18,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 589 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 05:45:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2022-03-20 05:45:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 5348. [2022-03-20 05:45:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 3600 states have (on average 1.2855555555555556) internal successors, (4628), 3622 states have internal predecessors, (4628), 1441 states have call successors, (1441), 308 states have call predecessors, (1441), 306 states have return successors, (1439), 1417 states have call predecessors, (1439), 1439 states have call successors, (1439) [2022-03-20 05:45:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7508 transitions. [2022-03-20 05:45:19,032 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7508 transitions. Word has length 98 [2022-03-20 05:45:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:45:19,033 INFO L478 AbstractCegarLoop]: Abstraction has 5348 states and 7508 transitions. [2022-03-20 05:45:19,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-20 05:45:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7508 transitions. [2022-03-20 05:45:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-03-20 05:45:19,034 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:45:19,034 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-03-20 05:45:19,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-20 05:45:19,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:19,269 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:45:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:45:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2067527905, now seen corresponding path program 2 times [2022-03-20 05:45:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:45:19,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79543415] [2022-03-20 05:45:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:45:19,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:45:19,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767404822] [2022-03-20 05:45:19,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:45:19,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:19,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:45:19,289 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:45:19,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-20 05:45:19,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:45:19,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:45:19,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-20 05:45:19,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:45:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 93 proven. 46 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-03-20 05:45:20,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:45:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-03-20 05:45:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:45:21,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79543415] [2022-03-20 05:45:21,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:45:21,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767404822] [2022-03-20 05:45:21,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767404822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:45:21,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:45:21,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-03-20 05:45:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252480670] [2022-03-20 05:45:21,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:45:21,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 05:45:21,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:45:21,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 05:45:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-03-20 05:45:21,094 INFO L87 Difference]: Start difference. First operand 5348 states and 7508 transitions. Second operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-20 05:45:25,544 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 [] [2022-03-20 05:45:29,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:45:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:45:31,026 INFO L93 Difference]: Finished difference Result 6297 states and 8815 transitions. [2022-03-20 05:45:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-20 05:45:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-03-20 05:45:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:45:31,046 INFO L225 Difference]: With dead ends: 6297 [2022-03-20 05:45:31,047 INFO L226 Difference]: Without dead ends: 6293 [2022-03-20 05:45:31,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-03-20 05:45:31,047 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 177 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 289 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-03-20 05:45:31,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 1006 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1264 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2022-03-20 05:45:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6293 states. [2022-03-20 05:45:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6293 to 5701. [2022-03-20 05:45:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 3772 states have (on average 1.2932131495227996) internal successors, (4878), 3794 states have internal predecessors, (4878), 1597 states have call successors, (1597), 333 states have call predecessors, (1597), 331 states have return successors, (1595), 1573 states have call predecessors, (1595), 1595 states have call successors, (1595) [2022-03-20 05:45:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 8070 transitions. [2022-03-20 05:45:31,156 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 8070 transitions. Word has length 108 [2022-03-20 05:45:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:45:31,156 INFO L478 AbstractCegarLoop]: Abstraction has 5701 states and 8070 transitions. [2022-03-20 05:45:31,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-20 05:45:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 8070 transitions. [2022-03-20 05:45:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-20 05:45:31,158 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:45:31,158 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2022-03-20 05:45:31,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-20 05:45:31,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-20 05:45:31,371 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:45:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:45:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -55503749, now seen corresponding path program 1 times [2022-03-20 05:45:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:45:31,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310162178] [2022-03-20 05:45:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:45:31,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:45:31,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536269279] [2022-03-20 05:45:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:31,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:45:31,383 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:45:31,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-20 05:45:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:45:31,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-20 05:45:31,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:45:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 116 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-20 05:45:31,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:45:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-03-20 05:45:31,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:45:31,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310162178] [2022-03-20 05:45:31,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:45:31,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536269279] [2022-03-20 05:45:31,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536269279] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:45:31,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:45:31,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-03-20 05:45:31,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688264033] [2022-03-20 05:45:31,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:45:31,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 05:45:31,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:45:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 05:45:31,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-03-20 05:45:31,899 INFO L87 Difference]: Start difference. First operand 5701 states and 8070 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-20 05:45:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:45:32,551 INFO L93 Difference]: Finished difference Result 6603 states and 8967 transitions. [2022-03-20 05:45:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-20 05:45:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-03-20 05:45:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:45:32,566 INFO L225 Difference]: With dead ends: 6603 [2022-03-20 05:45:32,566 INFO L226 Difference]: Without dead ends: 6603 [2022-03-20 05:45:32,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=708, Invalid=1272, Unknown=0, NotChecked=0, Total=1980 [2022-03-20 05:45:32,567 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 599 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 05:45:32,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 626 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 05:45:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2022-03-20 05:45:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 6434. [2022-03-20 05:45:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6434 states, 4203 states have (on average 1.211753509398049) internal successors, (5093), 4221 states have internal predecessors, (5093), 1853 states have call successors, (1853), 379 states have call predecessors, (1853), 377 states have return successors, (1851), 1833 states have call predecessors, (1851), 1851 states have call successors, (1851) [2022-03-20 05:45:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 8797 transitions. [2022-03-20 05:45:32,681 INFO L78 Accepts]: Start accepts. Automaton has 6434 states and 8797 transitions. Word has length 105 [2022-03-20 05:45:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:45:32,682 INFO L478 AbstractCegarLoop]: Abstraction has 6434 states and 8797 transitions. [2022-03-20 05:45:32,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-03-20 05:45:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6434 states and 8797 transitions. [2022-03-20 05:45:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-03-20 05:45:32,685 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:45:32,685 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-03-20 05:45:32,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-20 05:45:32,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-20 05:45:32,898 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:45:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:45:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1765875055, now seen corresponding path program 2 times [2022-03-20 05:45:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:45:32,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753476646] [2022-03-20 05:45:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:45:32,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:45:32,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443402431] [2022-03-20 05:45:32,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:45:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:45:32,906 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:45:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-20 05:45:32,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:45:32,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:45:32,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 05:45:32,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:45:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 311 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-03-20 05:45:33,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:45:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 119 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-03-20 05:45:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:45:33,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753476646] [2022-03-20 05:45:33,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:45:33,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443402431] [2022-03-20 05:45:33,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443402431] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:45:33,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:45:33,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-03-20 05:45:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309671014] [2022-03-20 05:45:33,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:45:33,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-20 05:45:33,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:45:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-20 05:45:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-03-20 05:45:33,684 INFO L87 Difference]: Start difference. First operand 6434 states and 8797 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-03-20 05:45:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:45:34,613 INFO L93 Difference]: Finished difference Result 11808 states and 16560 transitions. [2022-03-20 05:45:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-20 05:45:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2022-03-20 05:45:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:45:34,637 INFO L225 Difference]: With dead ends: 11808 [2022-03-20 05:45:34,637 INFO L226 Difference]: Without dead ends: 11808 [2022-03-20 05:45:34,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1327, Invalid=2333, Unknown=0, NotChecked=0, Total=3660 [2022-03-20 05:45:34,639 INFO L913 BasicCegarLoop]: 149 mSDtfsCounter, 1258 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 05:45:34,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1258 Valid, 935 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 05:45:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2022-03-20 05:45:34,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 11324. [2022-03-20 05:45:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11324 states, 7570 states have (on average 1.2715984147952444) internal successors, (9626), 7660 states have internal predecessors, (9626), 3197 states have call successors, (3197), 558 states have call predecessors, (3197), 556 states have return successors, (3195), 3105 states have call predecessors, (3195), 3195 states have call successors, (3195) [2022-03-20 05:45:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 16018 transitions. [2022-03-20 05:45:34,832 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 16018 transitions. Word has length 132 [2022-03-20 05:45:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:45:34,832 INFO L478 AbstractCegarLoop]: Abstraction has 11324 states and 16018 transitions. [2022-03-20 05:45:34,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-03-20 05:45:34,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 16018 transitions. [2022-03-20 05:45:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-03-20 05:45:34,835 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:45:34,835 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:45:34,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-20 05:45:35,052 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-20 05:45:35,052 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:45:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:45:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1118265052, now seen corresponding path program 3 times [2022-03-20 05:45:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:45:35,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026942921] [2022-03-20 05:45:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:45:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:45:35,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:45:35,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945357834] [2022-03-20 05:45:35,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 05:45:35,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:45:35,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:45:35,063 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:45:35,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-20 05:45:35,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-20 05:45:35,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:45:35,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-20 05:45:35,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:45:36,129 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 05:45:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 90 proven. 51 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2022-03-20 05:45:36,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:45:42,061 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 05:45:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:45:53,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026942921] [2022-03-20 05:45:53,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:45:53,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945357834] [2022-03-20 05:45:53,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945357834] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 05:45:53,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 05:45:53,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-03-20 05:45:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100587802] [2022-03-20 05:45:53,062 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 05:45:53,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 05:45:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:45:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 05:45:53,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=465, Unknown=7, NotChecked=0, Total=552 [2022-03-20 05:45:53,063 INFO L87 Difference]: Start difference. First operand 11324 states and 16018 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-20 05:46:03,382 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 [] [2022-03-20 05:46:05,385 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 [] [2022-03-20 05:46:09,532 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 [] [2022-03-20 05:46:11,534 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 [] [2022-03-20 05:46:12,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:46:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:46:13,014 INFO L93 Difference]: Finished difference Result 13255 states and 18725 transitions. [2022-03-20 05:46:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 05:46:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 138 [2022-03-20 05:46:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:46:13,042 INFO L225 Difference]: With dead ends: 13255 [2022-03-20 05:46:13,042 INFO L226 Difference]: Without dead ends: 13252 [2022-03-20 05:46:13,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=169, Invalid=944, Unknown=9, NotChecked=0, Total=1122 [2022-03-20 05:46:13,043 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 102 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 94 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:46:13,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 904 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 866 Invalid, 4 Unknown, 0 Unchecked, 10.1s Time] [2022-03-20 05:46:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2022-03-20 05:46:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 12853. [2022-03-20 05:46:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12853 states, 8548 states have (on average 1.2753860552175948) internal successors, (10902), 8650 states have internal predecessors, (10902), 3685 states have call successors, (3685), 621 states have call predecessors, (3685), 619 states have return successors, (3683), 3581 states have call predecessors, (3683), 3683 states have call successors, (3683) [2022-03-20 05:46:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12853 states to 12853 states and 18270 transitions. [2022-03-20 05:46:13,293 INFO L78 Accepts]: Start accepts. Automaton has 12853 states and 18270 transitions. Word has length 138 [2022-03-20 05:46:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:46:13,293 INFO L478 AbstractCegarLoop]: Abstraction has 12853 states and 18270 transitions. [2022-03-20 05:46:13,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-20 05:46:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 12853 states and 18270 transitions. [2022-03-20 05:46:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-03-20 05:46:13,297 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:46:13,297 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-03-20 05:46:13,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-20 05:46:13,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-20 05:46:13,511 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:46:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:46:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1657425713, now seen corresponding path program 4 times [2022-03-20 05:46:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:46:13,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060948197] [2022-03-20 05:46:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:46:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:46:13,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:46:13,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476477268] [2022-03-20 05:46:13,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 05:46:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:46:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:46:13,524 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:46:13,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-20 05:46:13,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 05:46:13,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:46:13,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 100 conjunts are in the unsatisfiable core [2022-03-20 05:46:13,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:46:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 95 proven. 148 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-03-20 05:46:14,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:46:15,257 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 05:46:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:46:17,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060948197] [2022-03-20 05:46:17,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:46:17,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476477268] [2022-03-20 05:46:17,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476477268] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 05:46:17,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 05:46:17,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-03-20 05:46:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14032506] [2022-03-20 05:46:17,180 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 05:46:17,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 05:46:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:46:17,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 05:46:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2022-03-20 05:46:17,180 INFO L87 Difference]: Start difference. First operand 12853 states and 18270 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-03-20 05:46:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:46:19,364 INFO L93 Difference]: Finished difference Result 13800 states and 19537 transitions. [2022-03-20 05:46:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-20 05:46:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) Word has length 145 [2022-03-20 05:46:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:46:19,399 INFO L225 Difference]: With dead ends: 13800 [2022-03-20 05:46:19,399 INFO L226 Difference]: Without dead ends: 13797 [2022-03-20 05:46:19,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=161, Invalid=1321, Unknown=0, NotChecked=0, Total=1482 [2022-03-20 05:46:19,401 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 132 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 05:46:19,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 1418 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 05:46:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13797 states. [2022-03-20 05:46:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13797 to 13485. [2022-03-20 05:46:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13485 states, 8906 states have (on average 1.2765551313721086) internal successors, (11369), 9012 states have internal predecessors, (11369), 3916 states have call successors, (3916), 664 states have call predecessors, (3916), 662 states have return successors, (3914), 3808 states have call predecessors, (3914), 3914 states have call successors, (3914) [2022-03-20 05:46:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13485 states to 13485 states and 19199 transitions. [2022-03-20 05:46:19,639 INFO L78 Accepts]: Start accepts. Automaton has 13485 states and 19199 transitions. Word has length 145 [2022-03-20 05:46:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:46:19,639 INFO L478 AbstractCegarLoop]: Abstraction has 13485 states and 19199 transitions. [2022-03-20 05:46:19,639 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 7 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 6 states have call predecessors, (19), 6 states have call successors, (19) [2022-03-20 05:46:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 13485 states and 19199 transitions. [2022-03-20 05:46:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-20 05:46:19,643 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:46:19,644 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:46:19,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-20 05:46:19,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-20 05:46:19,859 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:46:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:46:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1291712014, now seen corresponding path program 5 times [2022-03-20 05:46:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:46:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811387426] [2022-03-20 05:46:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:46:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:46:19,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:46:19,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427913294] [2022-03-20 05:46:19,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-20 05:46:19,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:46:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:46:19,869 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:46:19,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-20 05:46:20,089 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-03-20 05:46:20,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:46:20,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 95 conjunts are in the unsatisfiable core [2022-03-20 05:46:20,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:46:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 77 proven. 170 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2022-03-20 05:46:22,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:46:29,178 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_main_~d~0 c_main_~k~0))) (let ((.cse3 (+ (* (- 1) c_main_~q~0 .cse6) c_main_~p~0)) (.cse2 (+ (* (- 1) (* c_main_~s~0 .cse6)) c_main_~r~0))) (let ((.cse1 (* (- 1) c_main_~v~0)) (.cse4 (* .cse2 c_main_~y~0)) (.cse5 (* .cse3 c_main_~x~0)) (.cse0 (* c_main_~c~0 4))) (or (<= .cse0 (* c_main_~v~0 4)) (= (+ (* c_main_~q~0 c_main_~x~0) c_main_~c~0 (* c_main_~s~0 c_main_~y~0) .cse1) (+ (* .cse2 c_main_~y~0 0) (* (* .cse3 c_main_~x~0 1) 4) .cse4 (* .cse3 c_main_~x~0 0) .cse5 (* (* .cse2 c_main_~y~0 1) 4))) (not (= (+ c_main_~c~0 .cse1) (+ .cse4 .cse5))) (not (= c_main_~b~0 (+ (* c_main_~v~0 (- 4)) .cse0))))))) is different from true [2022-03-20 05:46:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 128 proven. 105 refuted. 0 times theorem prover too weak. 660 trivial. 10 not checked. [2022-03-20 05:46:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:46:29,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811387426] [2022-03-20 05:46:29,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:46:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427913294] [2022-03-20 05:46:29,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427913294] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:46:29,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:46:29,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 33 [2022-03-20 05:46:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24256265] [2022-03-20 05:46:29,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:46:29,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-20 05:46:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:46:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-20 05:46:29,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=843, Unknown=1, NotChecked=60, Total=1056 [2022-03-20 05:46:29,494 INFO L87 Difference]: Start difference. First operand 13485 states and 19199 transitions. Second operand has 33 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 13 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2022-03-20 05:46:40,182 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 [] [2022-03-20 05:46:44,435 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~q~0 c_main_~x~0)) (.cse3 (* c_main_~s~0 c_main_~y~0)) (.cse10 (* c_main_~p~0 c_main_~x~0)) (.cse11 (* c_main_~r~0 c_main_~y~0))) (let ((.cse0 (* c_main_~c~0 4)) (.cse1 (* c_main_~v~0 4)) (.cse16 (+ c_main_~b~0 .cse10 .cse11)) (.cse19 (* (* c_main_~s~0 c_main_~y~0 1) 4)) (.cse20 (* (* c_main_~q~0 c_main_~x~0 1) 4)) (.cse17 (* c_main_~q~0 c_main_~x~0 c_main_~k~0)) (.cse18 (* c_main_~s~0 c_main_~y~0 c_main_~k~0)) (.cse22 (* c_main_~b~0 4)) (.cse21 (not (= c_main_~b~0 (+ .cse2 .cse3))))) (and (let ((.cse9 (+ c_main_~d~0 c_main_~k~0))) (let ((.cse6 (+ (* (- 1) c_main_~q~0 .cse9) c_main_~p~0)) (.cse5 (+ (* (- 1) (* c_main_~s~0 .cse9)) c_main_~r~0))) (let ((.cse4 (* (- 1) c_main_~v~0)) (.cse7 (* .cse5 c_main_~y~0)) (.cse8 (* .cse6 c_main_~x~0))) (or (<= .cse0 .cse1) (= (+ .cse2 c_main_~c~0 .cse3 .cse4) (+ (* .cse5 c_main_~y~0 0) (* (* .cse6 c_main_~x~0 1) 4) .cse7 (* .cse6 c_main_~x~0 0) .cse8 (* (* .cse5 c_main_~y~0 1) 4))) (not (= (+ c_main_~c~0 .cse4) (+ .cse7 .cse8))) (not (= c_main_~b~0 (+ (* c_main_~v~0 (- 4)) .cse0))))))) (or (= (+ .cse10 .cse11) (+ .cse2 .cse3 c_main_~a~0)) (not (= c_main_~b~0 0))) (let ((.cse14 (+ c_main_~p~0 (* (- 1) c_main_~q~0 c_main_~k~0))) (.cse15 (+ c_main_~r~0 (* (- 1) (* c_main_~s~0 c_main_~k~0))))) (let ((.cse12 (* .cse15 c_main_~y~0)) (.cse13 (* .cse14 c_main_~x~0))) (or (<= .cse0 0) (not (= c_main_~c~0 (+ .cse12 .cse13))) (not (= c_main_~b~0 .cse0)) (= (+ (* .cse14 c_main_~x~0 0) (* (* .cse15 c_main_~y~0 1) 4) .cse12 .cse13 (* (* .cse14 c_main_~x~0 1) 4) (* .cse15 c_main_~y~0 0)) (+ .cse2 c_main_~c~0 .cse3))))) (or (<= .cse1 c_main_~c~0) (= .cse16 (+ .cse2 .cse17 (* (* c_main_~q~0 c_main_~d~0 c_main_~x~0) 2) (* 2 (* c_main_~s~0 c_main_~d~0 c_main_~y~0)) .cse3 .cse18)) (not (= c_main_~c~0 (* 2 c_main_~v~0)))) (or (= .cse16 (+ (* c_main_~q~0 c_main_~x~0 0) .cse19 .cse2 .cse20 (* c_main_~s~0 c_main_~y~0 0) .cse3)) .cse21 (not (= .cse22 c_main_~a~0)) (<= .cse22 0)) (or (<= (* c_main_~b~0 8) c_main_~c~0) (= .cse16 (+ .cse19 .cse2 .cse20 .cse17 .cse3 .cse18)) (not (= .cse22 c_main_~c~0)) .cse21)))) is different from true [2022-03-20 05:46:48,827 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 [] [2022-03-20 05:46:49,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:47:01,838 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 [] [2022-03-20 05:47:05,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:47:33,352 WARN L232 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 90 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 05:47:39,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:47:41,727 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 [] [2022-03-20 05:48:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:48:43,580 INFO L93 Difference]: Finished difference Result 20824 states and 30206 transitions. [2022-03-20 05:48:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-20 05:48:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 13 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 161 [2022-03-20 05:48:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:48:43,669 INFO L225 Difference]: With dead ends: 20824 [2022-03-20 05:48:43,669 INFO L226 Difference]: Without dead ends: 20820 [2022-03-20 05:48:43,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 325 SyntacticMatches, 41 SemanticMatches, 119 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6251 ImplicationChecksByTransitivity, 101.7s TimeCoverageRelationStatistics Valid=2451, Invalid=11597, Unknown=2, NotChecked=470, Total=14520 [2022-03-20 05:48:43,673 INFO L913 BasicCegarLoop]: 129 mSDtfsCounter, 447 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 1013 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 4582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 38.9s IncrementalHoareTripleChecker+Time [2022-03-20 05:48:43,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 2058 Invalid, 4582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 3272 Invalid, 5 Unknown, 292 Unchecked, 38.9s Time] [2022-03-20 05:48:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20820 states. [2022-03-20 05:48:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20820 to 16439. [2022-03-20 05:48:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16439 states, 10876 states have (on average 1.2932144170650974) internal successors, (14065), 11004 states have internal predecessors, (14065), 4793 states have call successors, (4793), 771 states have call predecessors, (4793), 769 states have return successors, (4791), 4663 states have call predecessors, (4791), 4791 states have call successors, (4791) [2022-03-20 05:48:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16439 states to 16439 states and 23649 transitions. [2022-03-20 05:48:44,085 INFO L78 Accepts]: Start accepts. Automaton has 16439 states and 23649 transitions. Word has length 161 [2022-03-20 05:48:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:48:44,094 INFO L478 AbstractCegarLoop]: Abstraction has 16439 states and 23649 transitions. [2022-03-20 05:48:44,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 3.129032258064516) internal successors, (97), 31 states have internal predecessors, (97), 13 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2022-03-20 05:48:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 16439 states and 23649 transitions. [2022-03-20 05:48:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-03-20 05:48:44,112 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:48:44,112 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-03-20 05:48:44,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-20 05:48:44,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:48:44,317 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:48:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:48:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2087386651, now seen corresponding path program 6 times [2022-03-20 05:48:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:48:44,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277961605] [2022-03-20 05:48:44,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:48:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:48:44,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:48:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857038806] [2022-03-20 05:48:44,324 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-20 05:48:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:48:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:48:44,340 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:48:44,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-20 05:48:44,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-03-20 05:48:44,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:48:44,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 05:48:44,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:48:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 368 proven. 21 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-03-20 05:48:44,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:48:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 120 proven. 21 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-03-20 05:48:44,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:48:44,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277961605] [2022-03-20 05:48:44,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:48:44,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857038806] [2022-03-20 05:48:44,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857038806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:48:44,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:48:44,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-03-20 05:48:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721541079] [2022-03-20 05:48:44,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:48:44,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 05:48:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:48:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 05:48:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-20 05:48:44,929 INFO L87 Difference]: Start difference. First operand 16439 states and 23649 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 5 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2022-03-20 05:48:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:48:45,196 INFO L93 Difference]: Finished difference Result 21850 states and 31974 transitions. [2022-03-20 05:48:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 05:48:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 5 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) Word has length 165 [2022-03-20 05:48:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:48:45,249 INFO L225 Difference]: With dead ends: 21850 [2022-03-20 05:48:45,249 INFO L226 Difference]: Without dead ends: 21850 [2022-03-20 05:48:45,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-20 05:48:45,250 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:48:45,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 335 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 05:48:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21850 states. [2022-03-20 05:48:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21850 to 19647. [2022-03-20 05:48:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19647 states, 12993 states have (on average 1.317016855229739) internal successors, (17112), 13282 states have internal predecessors, (17112), 5930 states have call successors, (5930), 725 states have call predecessors, (5930), 723 states have return successors, (5928), 5639 states have call predecessors, (5928), 5928 states have call successors, (5928) [2022-03-20 05:48:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19647 states to 19647 states and 28970 transitions. [2022-03-20 05:48:45,634 INFO L78 Accepts]: Start accepts. Automaton has 19647 states and 28970 transitions. Word has length 165 [2022-03-20 05:48:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:48:45,635 INFO L478 AbstractCegarLoop]: Abstraction has 19647 states and 28970 transitions. [2022-03-20 05:48:45,635 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 5 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) [2022-03-20 05:48:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19647 states and 28970 transitions. [2022-03-20 05:48:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-03-20 05:48:45,715 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:48:45,715 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:48:45,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-20 05:48:45,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-20 05:48:45,923 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:48:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:48:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1604879327, now seen corresponding path program 7 times [2022-03-20 05:48:45,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:48:45,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638633567] [2022-03-20 05:48:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:48:45,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:48:45,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:48:45,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685729345] [2022-03-20 05:48:45,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-20 05:48:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:48:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:48:45,940 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:48:45,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-20 05:48:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:48:46,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 113 conjunts are in the unsatisfiable core [2022-03-20 05:48:46,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:48:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 183 proven. 171 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2022-03-20 05:48:47,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:48:48,190 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 05:48:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:48:49,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638633567] [2022-03-20 05:48:49,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:48:49,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685729345] [2022-03-20 05:48:49,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685729345] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 05:48:49,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 05:48:49,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2022-03-20 05:48:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005321054] [2022-03-20 05:48:49,159 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-20 05:48:49,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 05:48:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:48:49,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 05:48:49,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2022-03-20 05:48:49,160 INFO L87 Difference]: Start difference. First operand 19647 states and 28970 transitions. Second operand has 23 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 9 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2022-03-20 05:48:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:48:50,684 INFO L93 Difference]: Finished difference Result 20711 states and 30465 transitions. [2022-03-20 05:48:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-20 05:48:50,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 9 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) Word has length 168 [2022-03-20 05:48:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:48:50,739 INFO L225 Difference]: With dead ends: 20711 [2022-03-20 05:48:50,740 INFO L226 Difference]: Without dead ends: 20708 [2022-03-20 05:48:50,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2022-03-20 05:48:50,740 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 129 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:48:50,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1582 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 05:48:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20708 states. [2022-03-20 05:48:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20708 to 19857. [2022-03-20 05:48:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19857 states, 13117 states have (on average 1.3153922390790578) internal successors, (17254), 13412 states have internal predecessors, (17254), 5999 states have call successors, (5999), 742 states have call predecessors, (5999), 740 states have return successors, (5997), 5702 states have call predecessors, (5997), 5997 states have call successors, (5997) [2022-03-20 05:48:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19857 states to 19857 states and 29250 transitions. [2022-03-20 05:48:51,325 INFO L78 Accepts]: Start accepts. Automaton has 19857 states and 29250 transitions. Word has length 168 [2022-03-20 05:48:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:48:51,325 INFO L478 AbstractCegarLoop]: Abstraction has 19857 states and 29250 transitions. [2022-03-20 05:48:51,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 9 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2022-03-20 05:48:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 19857 states and 29250 transitions. [2022-03-20 05:48:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-03-20 05:48:51,333 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:48:51,333 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:48:51,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-20 05:48:51,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:48:51,548 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:48:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:48:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1051070357, now seen corresponding path program 8 times [2022-03-20 05:48:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:48:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250983879] [2022-03-20 05:48:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:48:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:48:51,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:48:51,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839504629] [2022-03-20 05:48:51,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:48:51,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:48:51,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:48:51,558 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:48:51,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-20 05:48:51,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:48:51,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:48:51,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 119 conjunts are in the unsatisfiable core [2022-03-20 05:48:51,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:48:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 315 proven. 205 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-03-20 05:48:54,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:49:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 325 proven. 4 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2022-03-20 05:49:08,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:49:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250983879] [2022-03-20 05:49:08,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:49:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839504629] [2022-03-20 05:49:08,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839504629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:49:08,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:49:08,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 31 [2022-03-20 05:49:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501600107] [2022-03-20 05:49:08,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:49:08,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-20 05:49:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:49:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-20 05:49:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-03-20 05:49:08,953 INFO L87 Difference]: Start difference. First operand 19857 states and 29250 transitions. Second operand has 31 states, 25 states have (on average 3.52) internal successors, (88), 26 states have internal predecessors, (88), 14 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) [2022-03-20 05:49:15,813 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 [] [2022-03-20 05:49:27,844 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 [] [2022-03-20 05:49:36,304 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 [] [2022-03-20 05:49:40,518 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 [] [2022-03-20 05:49:54,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:50:00,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:50:04,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 05:50:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:50:08,640 INFO L93 Difference]: Finished difference Result 23729 states and 35325 transitions. [2022-03-20 05:50:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-20 05:50:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 3.52) internal successors, (88), 26 states have internal predecessors, (88), 14 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) Word has length 188 [2022-03-20 05:50:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:50:08,684 INFO L225 Difference]: With dead ends: 23729 [2022-03-20 05:50:08,684 INFO L226 Difference]: Without dead ends: 23725 [2022-03-20 05:50:08,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 353 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=1023, Invalid=6459, Unknown=0, NotChecked=0, Total=7482 [2022-03-20 05:50:08,690 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 241 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 468 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:50:08,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 1560 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 2193 Invalid, 6 Unknown, 0 Unchecked, 35.1s Time] [2022-03-20 05:50:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23725 states. [2022-03-20 05:50:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23725 to 17588. [2022-03-20 05:50:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17588 states, 11447 states have (on average 1.3015637284878134) internal successors, (14899), 11714 states have internal predecessors, (14899), 5406 states have call successors, (5406), 736 states have call predecessors, (5406), 734 states have return successors, (5404), 5137 states have call predecessors, (5404), 5404 states have call successors, (5404) [2022-03-20 05:50:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17588 states to 17588 states and 25709 transitions. [2022-03-20 05:50:09,072 INFO L78 Accepts]: Start accepts. Automaton has 17588 states and 25709 transitions. Word has length 188 [2022-03-20 05:50:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:50:09,072 INFO L478 AbstractCegarLoop]: Abstraction has 17588 states and 25709 transitions. [2022-03-20 05:50:09,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 3.52) internal successors, (88), 26 states have internal predecessors, (88), 14 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 13 states have call predecessors, (35), 12 states have call successors, (35) [2022-03-20 05:50:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17588 states and 25709 transitions. [2022-03-20 05:50:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-03-20 05:50:09,080 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:50:09,080 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 10, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:50:09,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-20 05:50:09,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:50:09,297 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:50:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:50:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1872087437, now seen corresponding path program 1 times [2022-03-20 05:50:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:50:09,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082477019] [2022-03-20 05:50:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:50:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:50:09,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:50:09,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1610557932] [2022-03-20 05:50:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:50:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:50:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:50:09,308 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:50:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-20 05:50:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:50:09,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-20 05:50:09,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:50:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 897 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-03-20 05:50:09,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:50:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 63 proven. 257 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-03-20 05:50:10,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:50:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082477019] [2022-03-20 05:50:10,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:50:10,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610557932] [2022-03-20 05:50:10,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610557932] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:50:10,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:50:10,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-03-20 05:50:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784900191] [2022-03-20 05:50:10,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:50:10,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-20 05:50:10,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:50:10,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-20 05:50:10,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-03-20 05:50:10,676 INFO L87 Difference]: Start difference. First operand 17588 states and 25709 transitions. Second operand has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-20 05:50:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:50:12,224 INFO L93 Difference]: Finished difference Result 27349 states and 39875 transitions. [2022-03-20 05:50:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-20 05:50:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 196 [2022-03-20 05:50:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:50:12,314 INFO L225 Difference]: With dead ends: 27349 [2022-03-20 05:50:12,314 INFO L226 Difference]: Without dead ends: 27349 [2022-03-20 05:50:12,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2609, Invalid=4531, Unknown=0, NotChecked=0, Total=7140 [2022-03-20 05:50:12,316 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 1357 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 05:50:12,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 1116 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 05:50:12,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27349 states. [2022-03-20 05:50:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27349 to 26874. [2022-03-20 05:50:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26874 states, 17218 states have (on average 1.2914972702985248) internal successors, (22237), 17525 states have internal predecessors, (22237), 8559 states have call successors, (8559), 1098 states have call predecessors, (8559), 1096 states have return successors, (8557), 8250 states have call predecessors, (8557), 8557 states have call successors, (8557) [2022-03-20 05:50:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26874 states to 26874 states and 39353 transitions. [2022-03-20 05:50:12,849 INFO L78 Accepts]: Start accepts. Automaton has 26874 states and 39353 transitions. Word has length 196 [2022-03-20 05:50:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:50:12,849 INFO L478 AbstractCegarLoop]: Abstraction has 26874 states and 39353 transitions. [2022-03-20 05:50:12,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9347826086956523) internal successors, (181), 46 states have internal predecessors, (181), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-20 05:50:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 26874 states and 39353 transitions. [2022-03-20 05:50:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-03-20 05:50:12,859 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:50:12,859 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:50:12,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-20 05:50:13,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-20 05:50:13,077 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:50:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:50:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2139737637, now seen corresponding path program 2 times [2022-03-20 05:50:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:50:13,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168003572] [2022-03-20 05:50:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:50:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:50:13,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:50:13,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389648974] [2022-03-20 05:50:13,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:50:13,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:50:13,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:50:13,108 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:50:13,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-20 05:50:13,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:50:13,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:50:13,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-20 05:50:13,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:50:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 950 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-03-20 05:50:13,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:50:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 101 proven. 310 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-03-20 05:50:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:50:14,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168003572] [2022-03-20 05:50:14,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:50:14,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389648974] [2022-03-20 05:50:14,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389648974] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:50:14,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:50:14,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-03-20 05:50:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919939325] [2022-03-20 05:50:14,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:50:14,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-20 05:50:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:50:14,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-20 05:50:14,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-03-20 05:50:14,661 INFO L87 Difference]: Start difference. First operand 26874 states and 39353 transitions. Second operand has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-20 05:50:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:50:16,721 INFO L93 Difference]: Finished difference Result 28198 states and 40115 transitions. [2022-03-20 05:50:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-20 05:50:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) Word has length 207 [2022-03-20 05:50:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:50:16,769 INFO L225 Difference]: With dead ends: 28198 [2022-03-20 05:50:16,769 INFO L226 Difference]: Without dead ends: 28198 [2022-03-20 05:50:16,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3132, Invalid=5424, Unknown=0, NotChecked=0, Total=8556 [2022-03-20 05:50:16,770 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 1778 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 1225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1225 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:50:16,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1778 Valid, 1150 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1225 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 05:50:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28198 states. [2022-03-20 05:50:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28198 to 27917. [2022-03-20 05:50:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27917 states, 17097 states have (on average 1.2061765221968765) internal successors, (20622), 17410 states have internal predecessors, (20622), 9603 states have call successors, (9603), 1218 states have call predecessors, (9603), 1216 states have return successors, (9601), 9288 states have call predecessors, (9601), 9601 states have call successors, (9601) [2022-03-20 05:50:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27917 states to 27917 states and 39826 transitions. [2022-03-20 05:50:17,257 INFO L78 Accepts]: Start accepts. Automaton has 27917 states and 39826 transitions. Word has length 207 [2022-03-20 05:50:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:50:17,258 INFO L478 AbstractCegarLoop]: Abstraction has 27917 states and 39826 transitions. [2022-03-20 05:50:17,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.98) internal successors, (199), 50 states have internal predecessors, (199), 14 states have call successors, (48), 9 states have call predecessors, (48), 8 states have return successors, (46), 12 states have call predecessors, (46), 13 states have call successors, (46) [2022-03-20 05:50:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27917 states and 39826 transitions. [2022-03-20 05:50:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-03-20 05:50:17,277 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:50:17,277 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 15, 15, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:50:17,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-20 05:50:17,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-20 05:50:17,494 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:50:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:50:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash -777184055, now seen corresponding path program 3 times [2022-03-20 05:50:17,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:50:17,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936381744] [2022-03-20 05:50:17,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:50:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:50:17,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:50:17,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485044435] [2022-03-20 05:50:17,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 05:50:17,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:50:17,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:50:17,507 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:50:17,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-20 05:50:56,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-03-20 05:50:56,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:50:56,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-20 05:50:56,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:50:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 1955 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-03-20 05:50:56,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:50:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2183 backedges. 56 proven. 611 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2022-03-20 05:50:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:50:58,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936381744] [2022-03-20 05:50:58,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:50:58,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485044435] [2022-03-20 05:50:58,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485044435] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:50:58,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:50:58,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2022-03-20 05:50:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702491235] [2022-03-20 05:50:58,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:50:58,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-20 05:50:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:50:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-20 05:50:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2022-03-20 05:50:58,231 INFO L87 Difference]: Start difference. First operand 27917 states and 39826 transitions. Second operand has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) [2022-03-20 05:51:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:51:00,937 INFO L93 Difference]: Finished difference Result 48522 states and 71248 transitions. [2022-03-20 05:51:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-03-20 05:51:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) Word has length 268 [2022-03-20 05:51:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:51:01,021 INFO L225 Difference]: With dead ends: 48522 [2022-03-20 05:51:01,021 INFO L226 Difference]: Without dead ends: 48522 [2022-03-20 05:51:01,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2633 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=5711, Invalid=9789, Unknown=0, NotChecked=0, Total=15500 [2022-03-20 05:51:01,023 INFO L913 BasicCegarLoop]: 282 mSDtfsCounter, 2422 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 1673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1673 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 05:51:01,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2422 Valid, 1580 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1673 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 05:51:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48522 states. [2022-03-20 05:51:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48522 to 46465. [2022-03-20 05:51:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46465 states, 29829 states have (on average 1.2904220724798015) internal successors, (38492), 30363 states have internal predecessors, (38492), 14955 states have call successors, (14955), 1682 states have call predecessors, (14955), 1680 states have return successors, (14953), 14419 states have call predecessors, (14953), 14953 states have call successors, (14953) [2022-03-20 05:51:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46465 states to 46465 states and 68400 transitions. [2022-03-20 05:51:01,870 INFO L78 Accepts]: Start accepts. Automaton has 46465 states and 68400 transitions. Word has length 268 [2022-03-20 05:51:01,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:51:01,870 INFO L478 AbstractCegarLoop]: Abstraction has 46465 states and 68400 transitions. [2022-03-20 05:51:01,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 66 states have internal predecessors, (255), 18 states have call successors, (64), 11 states have call predecessors, (64), 10 states have return successors, (62), 16 states have call predecessors, (62), 17 states have call successors, (62) [2022-03-20 05:51:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 46465 states and 68400 transitions. [2022-03-20 05:51:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2022-03-20 05:51:01,900 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:51:01,900 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 40, 22, 21, 13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:51:01,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-20 05:51:02,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-20 05:51:02,126 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:51:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:51:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2114344233, now seen corresponding path program 2 times [2022-03-20 05:51:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:51:02,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059286052] [2022-03-20 05:51:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:51:02,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:51:02,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:51:02,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178350030] [2022-03-20 05:51:02,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:51:02,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:51:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:51:02,260 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:51:02,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-20 05:51:02,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:51:02,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:51:02,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 91 conjunts are in the unsatisfiable core [2022-03-20 05:51:02,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:51:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 4165 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-03-20 05:51:03,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:51:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4536 backedges. 127 proven. 1285 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2022-03-20 05:51:04,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:51:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059286052] [2022-03-20 05:51:04,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:51:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178350030] [2022-03-20 05:51:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178350030] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:51:04,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:51:04,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2022-03-20 05:51:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604331177] [2022-03-20 05:51:04,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:51:04,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-03-20 05:51:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:51:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-03-20 05:51:04,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4010, Invalid=4362, Unknown=0, NotChecked=0, Total=8372 [2022-03-20 05:51:04,954 INFO L87 Difference]: Start difference. First operand 46465 states and 68400 transitions. Second operand has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) [2022-03-20 05:51:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:51:11,633 INFO L93 Difference]: Finished difference Result 65465 states and 95947 transitions. [2022-03-20 05:51:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2022-03-20 05:51:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) Word has length 377 [2022-03-20 05:51:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:51:11,798 INFO L225 Difference]: With dead ends: 65465 [2022-03-20 05:51:11,798 INFO L226 Difference]: Without dead ends: 65465 [2022-03-20 05:51:11,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11533, Invalid=19619, Unknown=0, NotChecked=0, Total=31152 [2022-03-20 05:51:11,800 INFO L913 BasicCegarLoop]: 381 mSDtfsCounter, 3633 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 2391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3633 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 5084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2391 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-20 05:51:11,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3633 Valid, 2274 Invalid, 5084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2391 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-20 05:51:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65465 states. [2022-03-20 05:51:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65465 to 64880. [2022-03-20 05:51:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64880 states, 40968 states have (on average 1.2807313024799845) internal successors, (52469), 41733 states have internal predecessors, (52469), 21435 states have call successors, (21435), 2478 states have call predecessors, (21435), 2476 states have return successors, (21433), 20668 states have call predecessors, (21433), 21433 states have call successors, (21433) [2022-03-20 05:51:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64880 states to 64880 states and 95337 transitions. [2022-03-20 05:51:13,087 INFO L78 Accepts]: Start accepts. Automaton has 64880 states and 95337 transitions. Word has length 377 [2022-03-20 05:51:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:51:13,088 INFO L478 AbstractCegarLoop]: Abstraction has 64880 states and 95337 transitions. [2022-03-20 05:51:13,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 3.891304347826087) internal successors, (358), 92 states have internal predecessors, (358), 24 states have call successors, (88), 14 states have call predecessors, (88), 13 states have return successors, (86), 22 states have call predecessors, (86), 23 states have call successors, (86) [2022-03-20 05:51:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 64880 states and 95337 transitions. [2022-03-20 05:51:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2022-03-20 05:51:13,115 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:51:13,115 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 44, 24, 24, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:51:13,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-20 05:51:13,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:51:13,333 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:51:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:51:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2036089593, now seen corresponding path program 3 times [2022-03-20 05:51:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:51:13,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740732657] [2022-03-20 05:51:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:51:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:51:13,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:51:13,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457234524] [2022-03-20 05:51:13,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-20 05:51:13,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:51:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:51:13,354 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:51:13,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-20 05:51:13,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-20 05:51:13,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:51:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 05:51:13,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:51:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5477 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-03-20 05:51:13,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 05:51:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:51:13,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740732657] [2022-03-20 05:51:13,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:51:13,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457234524] [2022-03-20 05:51:13,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457234524] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 05:51:13,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 05:51:13,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 05:51:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062215054] [2022-03-20 05:51:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 05:51:13,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 05:51:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:51:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 05:51:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-20 05:51:13,944 INFO L87 Difference]: Start difference. First operand 64880 states and 95337 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 05:51:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:51:14,680 INFO L93 Difference]: Finished difference Result 88385 states and 129365 transitions. [2022-03-20 05:51:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 05:51:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 411 [2022-03-20 05:51:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:51:14,953 INFO L225 Difference]: With dead ends: 88385 [2022-03-20 05:51:14,953 INFO L226 Difference]: Without dead ends: 87449 [2022-03-20 05:51:14,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-20 05:51:14,953 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:51:14,953 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 247 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 05:51:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87449 states. [2022-03-20 05:51:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87449 to 75580. [2022-03-20 05:51:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75580 states, 45769 states have (on average 1.2884266643361226) internal successors, (58970), 46782 states have internal predecessors, (58970), 26655 states have call successors, (26655), 3157 states have call predecessors, (26655), 3155 states have return successors, (26653), 25640 states have call predecessors, (26653), 26653 states have call successors, (26653) [2022-03-20 05:51:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75580 states to 75580 states and 112278 transitions. [2022-03-20 05:51:16,940 INFO L78 Accepts]: Start accepts. Automaton has 75580 states and 112278 transitions. Word has length 411 [2022-03-20 05:51:16,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:51:16,940 INFO L478 AbstractCegarLoop]: Abstraction has 75580 states and 112278 transitions. [2022-03-20 05:51:16,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 05:51:16,940 INFO L276 IsEmpty]: Start isEmpty. Operand 75580 states and 112278 transitions. [2022-03-20 05:51:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2022-03-20 05:51:16,995 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:51:16,995 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 44, 31, 31, 19, 19, 19, 13, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:51:17,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-03-20 05:51:17,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-20 05:51:17,211 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:51:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:51:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -775482707, now seen corresponding path program 1 times [2022-03-20 05:51:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:51:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878545391] [2022-03-20 05:51:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:51:17,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:51:17,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:51:17,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381310101] [2022-03-20 05:51:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:51:17,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:51:17,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:51:17,225 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:51:17,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-20 05:51:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 05:51:17,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 97 conjunts are in the unsatisfiable core [2022-03-20 05:51:17,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:51:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6347 backedges. 931 proven. 4994 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-03-20 05:51:18,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:51:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6347 backedges. 931 proven. 1474 refuted. 0 times theorem prover too weak. 3942 trivial. 0 not checked. [2022-03-20 05:51:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:51:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878545391] [2022-03-20 05:51:20,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:51:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381310101] [2022-03-20 05:51:20,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381310101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:51:20,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:51:20,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2022-03-20 05:51:20,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477804754] [2022-03-20 05:51:20,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:51:20,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-20 05:51:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:51:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-20 05:51:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2022-03-20 05:51:20,026 INFO L87 Difference]: Start difference. First operand 75580 states and 112278 transitions. Second operand has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) [2022-03-20 05:51:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:51:27,618 INFO L93 Difference]: Finished difference Result 65515 states and 93919 transitions. [2022-03-20 05:51:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-03-20 05:51:27,619 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) Word has length 452 [2022-03-20 05:51:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:51:27,782 INFO L225 Difference]: With dead ends: 65515 [2022-03-20 05:51:27,783 INFO L226 Difference]: Without dead ends: 65515 [2022-03-20 05:51:27,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6259 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=13164, Invalid=22368, Unknown=0, NotChecked=0, Total=35532 [2022-03-20 05:51:27,785 INFO L913 BasicCegarLoop]: 405 mSDtfsCounter, 4216 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 3132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4216 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 5630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3132 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-20 05:51:27,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4216 Valid, 2237 Invalid, 5630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3132 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-20 05:51:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65515 states. [2022-03-20 05:51:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65515 to 65104. [2022-03-20 05:51:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65104 states, 39310 states have (on average 1.2024421266853218) internal successors, (47268), 40061 states have internal predecessors, (47268), 23118 states have call successors, (23118), 2677 states have call predecessors, (23118), 2675 states have return successors, (23116), 22365 states have call predecessors, (23116), 23116 states have call successors, (23116) [2022-03-20 05:51:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65104 states to 65104 states and 93502 transitions. [2022-03-20 05:51:29,060 INFO L78 Accepts]: Start accepts. Automaton has 65104 states and 93502 transitions. Word has length 452 [2022-03-20 05:51:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:51:29,061 INFO L478 AbstractCegarLoop]: Abstraction has 65104 states and 93502 transitions. [2022-03-20 05:51:29,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.9489795918367347) internal successors, (387), 98 states have internal predecessors, (387), 26 states have call successors, (96), 15 states have call predecessors, (96), 14 states have return successors, (94), 24 states have call predecessors, (94), 25 states have call successors, (94) [2022-03-20 05:51:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 65104 states and 93502 transitions. [2022-03-20 05:51:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2022-03-20 05:51:29,100 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:51:29,101 INFO L499 BasicCegarLoop]: trace histogram [61, 60, 60, 31, 31, 17, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:51:29,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-20 05:51:29,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-20 05:51:29,318 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:51:29,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:51:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash -452335303, now seen corresponding path program 4 times [2022-03-20 05:51:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:51:29,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050896688] [2022-03-20 05:51:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:51:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:51:29,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:51:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084668021] [2022-03-20 05:51:29,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 05:51:29,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:51:29,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:51:29,335 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:51:29,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-20 05:51:35,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 05:51:35,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:51:35,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 129 conjunts are in the unsatisfiable core [2022-03-20 05:51:35,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:51:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 120 proven. 9467 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-03-20 05:51:37,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:51:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 120 proven. 2747 refuted. 0 times theorem prover too weak. 7084 trivial. 0 not checked. [2022-03-20 05:51:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:51:40,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050896688] [2022-03-20 05:51:40,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:51:40,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084668021] [2022-03-20 05:51:40,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084668021] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:51:40,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:51:40,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 104 [2022-03-20 05:51:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63951302] [2022-03-20 05:51:40,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:51:40,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-20 05:51:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:51:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-20 05:51:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-03-20 05:51:40,388 INFO L87 Difference]: Start difference. First operand 65104 states and 93502 transitions. Second operand has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) [2022-03-20 05:51:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:51:48,852 INFO L93 Difference]: Finished difference Result 72957 states and 105161 transitions. [2022-03-20 05:51:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-20 05:51:48,854 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) Word has length 540 [2022-03-20 05:51:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:51:49,011 INFO L225 Difference]: With dead ends: 72957 [2022-03-20 05:51:49,012 INFO L226 Difference]: Without dead ends: 72893 [2022-03-20 05:51:49,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=14920, Invalid=25280, Unknown=0, NotChecked=0, Total=40200 [2022-03-20 05:51:49,015 INFO L913 BasicCegarLoop]: 429 mSDtfsCounter, 4192 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 3021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 5634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3021 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-20 05:51:49,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4192 Valid, 2738 Invalid, 5634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3021 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-20 05:51:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72893 states. [2022-03-20 05:51:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72893 to 71709. [2022-03-20 05:51:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71709 states, 43599 states have (on average 1.2126654281061493) internal successors, (52871), 44496 states have internal predecessors, (52871), 25221 states have call successors, (25221), 2890 states have call predecessors, (25221), 2888 states have return successors, (25219), 24322 states have call predecessors, (25219), 25219 states have call successors, (25219) [2022-03-20 05:51:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71709 states to 71709 states and 103311 transitions. [2022-03-20 05:51:50,448 INFO L78 Accepts]: Start accepts. Automaton has 71709 states and 103311 transitions. Word has length 540 [2022-03-20 05:51:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:51:50,448 INFO L478 AbstractCegarLoop]: Abstraction has 71709 states and 103311 transitions. [2022-03-20 05:51:50,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 4.836538461538462) internal successors, (503), 104 states have internal predecessors, (503), 33 states have call successors, (128), 18 states have call predecessors, (128), 17 states have return successors, (126), 31 states have call predecessors, (126), 32 states have call successors, (126) [2022-03-20 05:51:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 71709 states and 103311 transitions. [2022-03-20 05:51:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2022-03-20 05:51:50,583 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:51:50,583 INFO L499 BasicCegarLoop]: trace histogram [89, 88, 88, 44, 43, 24, 24, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:51:50,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-03-20 05:51:50,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-20 05:51:50,791 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:51:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:51:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1290306337, now seen corresponding path program 2 times [2022-03-20 05:51:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:51:50,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531627938] [2022-03-20 05:51:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:51:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:51:50,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:51:50,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682435202] [2022-03-20 05:51:50,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:51:50,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:51:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:51:50,807 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:51:50,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-20 05:51:51,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:51:51,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:51:51,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 181 conjunts are in the unsatisfiable core [2022-03-20 05:51:51,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:51:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21195 backedges. 267 proven. 20396 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2022-03-20 05:51:53,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:51:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21195 backedges. 267 proven. 5612 refuted. 0 times theorem prover too weak. 15316 trivial. 0 not checked. [2022-03-20 05:51:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:51:55,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531627938] [2022-03-20 05:51:55,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:51:55,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682435202] [2022-03-20 05:51:55,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682435202] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:51:55,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:51:55,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 104 [2022-03-20 05:51:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234049766] [2022-03-20 05:51:55,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:51:55,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-20 05:51:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:51:55,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-20 05:51:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-03-20 05:51:55,181 INFO L87 Difference]: Start difference. First operand 71709 states and 103311 transitions. Second operand has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) [2022-03-20 05:52:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:52:03,846 INFO L93 Difference]: Finished difference Result 70688 states and 101374 transitions. [2022-03-20 05:52:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-20 05:52:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) Word has length 774 [2022-03-20 05:52:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:52:04,027 INFO L225 Difference]: With dead ends: 70688 [2022-03-20 05:52:04,028 INFO L226 Difference]: Without dead ends: 70688 [2022-03-20 05:52:04,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1644 GetRequests, 1444 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6047 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=14944, Invalid=25256, Unknown=0, NotChecked=0, Total=40200 [2022-03-20 05:52:04,030 INFO L913 BasicCegarLoop]: 429 mSDtfsCounter, 3471 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 2765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3471 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 5320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2765 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-03-20 05:52:04,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3471 Valid, 2722 Invalid, 5320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2765 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-03-20 05:52:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70688 states. [2022-03-20 05:52:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70688 to 70517. [2022-03-20 05:52:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70517 states, 42580 states have (on average 1.2010098637858149) internal successors, (51139), 43391 states have internal predecessors, (51139), 25033 states have call successors, (25033), 2905 states have call predecessors, (25033), 2903 states have return successors, (25031), 24220 states have call predecessors, (25031), 25031 states have call successors, (25031) [2022-03-20 05:52:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70517 states to 70517 states and 101203 transitions. [2022-03-20 05:52:05,324 INFO L78 Accepts]: Start accepts. Automaton has 70517 states and 101203 transitions. Word has length 774 [2022-03-20 05:52:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:52:05,324 INFO L478 AbstractCegarLoop]: Abstraction has 70517 states and 101203 transitions. [2022-03-20 05:52:05,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 6.788461538461538) internal successors, (706), 104 states have internal predecessors, (706), 48 states have call successors, (184), 26 states have call predecessors, (184), 25 states have return successors, (182), 46 states have call predecessors, (182), 47 states have call successors, (182) [2022-03-20 05:52:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 70517 states and 101203 transitions. [2022-03-20 05:52:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2022-03-20 05:52:05,392 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:52:05,392 INFO L499 BasicCegarLoop]: trace histogram [93, 92, 92, 50, 50, 26, 26, 26, 25, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:52:05,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-20 05:52:05,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-20 05:52:05,604 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:52:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:52:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2079114935, now seen corresponding path program 2 times [2022-03-20 05:52:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:52:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122608945] [2022-03-20 05:52:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:52:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:52:05,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:52:05,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453775774] [2022-03-20 05:52:05,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 05:52:05,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:52:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:52:05,642 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:52:05,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-20 05:52:05,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 05:52:05,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 05:52:05,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 2164 conjuncts, 193 conjunts are in the unsatisfiable core [2022-03-20 05:52:05,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 05:52:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23999 backedges. 843 proven. 22586 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-03-20 05:52:09,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 05:52:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 23999 backedges. 843 proven. 6394 refuted. 0 times theorem prover too weak. 16762 trivial. 0 not checked. [2022-03-20 05:52:10,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 05:52:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122608945] [2022-03-20 05:52:10,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 05:52:10,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453775774] [2022-03-20 05:52:10,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453775774] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 05:52:10,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 05:52:10,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 104 [2022-03-20 05:52:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218396831] [2022-03-20 05:52:10,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-20 05:52:10,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-03-20 05:52:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 05:52:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-03-20 05:52:10,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2022-03-20 05:52:10,393 INFO L87 Difference]: Start difference. First operand 70517 states and 101203 transitions. Second operand has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) [2022-03-20 05:52:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 05:52:19,820 INFO L93 Difference]: Finished difference Result 69606 states and 99580 transitions. [2022-03-20 05:52:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2022-03-20 05:52:19,821 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) Word has length 830 [2022-03-20 05:52:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 05:52:20,047 INFO L225 Difference]: With dead ends: 69606 [2022-03-20 05:52:20,047 INFO L226 Difference]: Without dead ends: 69606 [2022-03-20 05:52:20,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1556 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5988 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=14949, Invalid=25251, Unknown=0, NotChecked=0, Total=40200 [2022-03-20 05:52:20,050 INFO L913 BasicCegarLoop]: 429 mSDtfsCounter, 3704 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 3105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3704 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 5862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3105 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-03-20 05:52:20,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3704 Valid, 2270 Invalid, 5862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3105 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-03-20 05:52:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69606 states. [2022-03-20 05:52:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69606 to 69606. [2022-03-20 05:52:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69606 states, 41989 states have (on average 1.192169377694158) internal successors, (50058), 42782 states have internal predecessors, (50058), 24762 states have call successors, (24762), 2856 states have call predecessors, (24762), 2854 states have return successors, (24760), 23967 states have call predecessors, (24760), 24760 states have call successors, (24760) [2022-03-20 05:52:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69606 states to 69606 states and 99580 transitions. [2022-03-20 05:52:21,477 INFO L78 Accepts]: Start accepts. Automaton has 69606 states and 99580 transitions. Word has length 830 [2022-03-20 05:52:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 05:52:21,478 INFO L478 AbstractCegarLoop]: Abstraction has 69606 states and 99580 transitions. [2022-03-20 05:52:21,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 7.298076923076923) internal successors, (759), 104 states have internal predecessors, (759), 50 states have call successors, (192), 27 states have call predecessors, (192), 26 states have return successors, (190), 48 states have call predecessors, (190), 49 states have call successors, (190) [2022-03-20 05:52:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 69606 states and 99580 transitions. [2022-03-20 05:52:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2022-03-20 05:52:21,544 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 05:52:21,544 INFO L499 BasicCegarLoop]: trace histogram [97, 96, 96, 51, 50, 27, 26, 26, 26, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:52:21,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-20 05:52:21,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:52:21,763 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 05:52:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 05:52:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1039841869, now seen corresponding path program 1 times [2022-03-20 05:52:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 05:52:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571019605] [2022-03-20 05:52:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:52:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 05:52:21,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 05:52:21,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604793964] [2022-03-20 05:52:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 05:52:21,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:52:21,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 05:52:21,945 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 05:52:21,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-20 05:52:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 05:52:29,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-20 05:52:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-20 05:52:48,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-20 05:52:48,293 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-03-20 05:52:48,294 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 05:52:48,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-20 05:52:48,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 05:52:48,510 INFO L719 BasicCegarLoop]: Path program histogram: [8, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 05:52:48,514 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 05:52:48,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 05:52:48 BasicIcfg [2022-03-20 05:52:48,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 05:52:48,653 INFO L158 Benchmark]: Toolchain (without parser) took 578595.21ms. Allocated memory was 198.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 144.2MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-03-20 05:52:48,653 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 198.2MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 05:52:48,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.30ms. Allocated memory is still 198.2MB. Free memory was 144.0MB in the beginning and 167.7MB in the end (delta: -23.7MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2022-03-20 05:52:48,654 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 198.2MB. Free memory was 167.7MB in the beginning and 166.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 05:52:48,654 INFO L158 Benchmark]: RCFGBuilder took 372.79ms. Allocated memory is still 198.2MB. Free memory was 166.1MB in the beginning and 154.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 05:52:48,654 INFO L158 Benchmark]: IcfgTransformer took 34.93ms. Allocated memory is still 198.2MB. Free memory was 154.3MB in the beginning and 152.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 05:52:48,654 INFO L158 Benchmark]: TraceAbstraction took 577883.76ms. Allocated memory was 198.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 152.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-03-20 05:52:48,658 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.18ms. Allocated memory is still 198.2MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.30ms. Allocated memory is still 198.2MB. Free memory was 144.0MB in the beginning and 167.7MB in the end (delta: -23.7MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 198.2MB. Free memory was 167.7MB in the beginning and 166.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 372.79ms. Allocated memory is still 198.2MB. Free memory was 166.1MB in the beginning and 154.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 34.93ms. Allocated memory is still 198.2MB. Free memory was 154.3MB in the beginning and 152.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 577883.76ms. Allocated memory was 198.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 152.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=104, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=121393, y=196418] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=121393, y=196418] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=121393, b=196418, counter=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=121393, b=196418, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=1, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=121393, b=196418, c=121393, counter=2, k=0, p=1, q=0, r=0, s=1, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=196418, b=121393, c=121393, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=121393, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=196418, b=121393, c=196418, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=196418, b=121393, c=75025, counter=6, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=121393, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=121393, b=75025, c=75025, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=75025, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=8, counter++=7, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=121393, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, counter++=8, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=121393, b=75025, c=121393, counter=9, d=1, k=0, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=10, counter++=9, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=121393, b=75025, c=46368, counter=10, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=75025, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=75025, b=46368, c=46368, counter=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=46368, counter=11, counter++=10, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=12, counter++=11, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=75025, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, counter++=12, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=75025, b=46368, c=75025, counter=13, d=1, k=0, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=14, counter++=13, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=75025, b=46368, c=28657, counter=14, d=1, k=1, p=-1, q=2, r=1, s=-1, temp=0, v=46368, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=46368, b=28657, c=28657, counter=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=28657, counter=15, counter++=14, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=16, counter++=15, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=46368, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, counter++=16, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=46368, b=28657, c=46368, counter=17, d=1, k=0, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=18, counter++=17, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=46368, b=28657, c=17711, counter=18, d=1, k=1, p=2, q=-3, r=-1, s=2, temp=1, v=28657, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=28657, b=17711, c=17711, counter=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=17711, counter=19, counter++=18, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=20, counter++=19, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=28657, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, counter++=20, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=28657, b=17711, c=28657, counter=21, d=1, k=0, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=22, counter++=21, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=28657, b=17711, c=10946, counter=22, d=1, k=1, p=-3, q=5, r=2, s=-3, temp=-1, v=17711, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=17711, b=10946, c=10946, counter=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=10946, counter=23, counter++=22, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=24, counter++=23, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=17711, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, counter++=24, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=17711, b=10946, c=17711, counter=25, d=1, k=0, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=26, counter++=25, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=17711, b=10946, c=6765, counter=26, d=1, k=1, p=5, q=-8, r=-3, s=5, temp=2, v=10946, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=10946, b=6765, c=6765, counter=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=6765, counter=27, counter++=26, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=28, counter++=27, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=10946, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, counter++=28, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=10946, b=6765, c=10946, counter=29, d=1, k=0, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=30, counter++=29, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=10946, b=6765, c=4181, counter=30, d=1, k=1, p=-8, q=13, r=5, s=-8, temp=-3, v=6765, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=6765, b=4181, c=4181, counter=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=4181, counter=31, counter++=30, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=32, counter++=31, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=6765, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, counter++=32, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=6765, b=4181, c=6765, counter=33, d=1, k=0, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=34, counter++=33, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=6765, b=4181, c=2584, counter=34, d=1, k=1, p=13, q=-21, r=-8, s=13, temp=5, v=4181, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=35, counter++=34, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=36, counter++=35, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=4181, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, counter++=36, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=37, d=1, k=0, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=38, counter++=37, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=38, d=1, k=1, p=-21, q=34, r=13, s=-21, temp=-8, v=2584, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=39, counter++=38, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=40, counter++=39, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=2584, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, counter++=40, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=41, d=1, k=0, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=42, counter++=41, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=42, d=1, k=1, p=34, q=-55, r=-21, s=34, temp=13, v=1597, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=1597, b=987, c=987, counter=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=987, counter=43, counter++=42, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=44, counter++=43, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=1597, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, counter++=44, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=45, d=1, k=0, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=1597, b=987, c=610, counter=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=610, counter=46, counter++=45, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=46, d=1, k=1, p=-55, q=89, r=34, s=-55, temp=-21, v=987, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=987, b=610, c=610, counter=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=610, counter=47, counter++=46, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=987, b=610, c=987, counter=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=48, counter++=47, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=987, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=987, b=610, c=987, counter=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, counter++=48, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=987, b=610, c=987, counter=49, d=1, k=0, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=987, b=610, c=377, counter=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=377, counter=50, counter++=49, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=987, b=610, c=377, counter=50, d=1, k=1, p=89, q=-144, r=-55, s=89, temp=34, v=610, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=610, b=377, c=377, counter=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=51, counter++=50, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=610, b=377, c=610, counter=51, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=52, counter++=51, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=610, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=610, b=377, c=610, counter=52, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, counter++=52, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=53] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=53] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=610, b=377, c=610, counter=53, d=1, k=0, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=610, b=377, c=233, counter=53, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=54, counter++=53, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=54, d=1, k=1, p=-144, q=233, r=89, s=-144, temp=-55, v=377, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=377, b=233, c=233, counter=54, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=55, counter++=54, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=377, b=233, c=377, counter=55, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=56, counter++=55, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=377, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=377, b=233, c=377, counter=56, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, counter++=56, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=57] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=57] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=377, b=233, c=377, counter=57, d=1, k=0, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=377, b=233, c=144, counter=57, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=58, counter++=57, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=58, d=1, k=1, p=233, q=-377, r=-144, s=233, temp=89, v=233, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=233, b=144, c=144, counter=58, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=59, counter++=58, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=233, b=144, c=233, counter=59, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=60, counter++=59, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=233, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=233, b=144, c=233, counter=60, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, counter++=60, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=61] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=61] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=233, b=144, c=233, counter=61, d=1, k=0, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=233, b=144, c=89, counter=61, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=62, counter++=61, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=62, d=1, k=1, p=-377, q=610, r=233, s=-377, temp=-144, v=144, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=144, b=89, c=89, counter=62, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=63, counter++=62, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=144, b=89, c=144, counter=63, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=64, counter++=63, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=144, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=144, b=89, c=144, counter=64, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, counter++=64, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=65] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=65] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=144, b=89, c=144, counter=65, d=1, k=0, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=144, b=89, c=55, counter=65, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=66, counter++=65, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=66, d=1, k=1, p=610, q=-987, r=-377, s=610, temp=233, v=89, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=89, b=55, c=55, counter=66, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=67, counter++=66, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=89, b=55, c=89, counter=67, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=68, counter++=67, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=89, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=89, b=55, c=89, counter=68, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, counter++=68, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=69] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=69] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=89, b=55, c=89, counter=69, d=1, k=0, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=89, b=55, c=34, counter=69, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=70, counter++=69, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=70, d=1, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, v=55, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=70, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=71, counter++=70, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=71, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=72, counter++=71, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=55, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=55, b=34, c=55, counter=72, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, counter++=72, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=73] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=73] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=55, b=34, c=55, counter=73, d=1, k=0, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=55, b=34, c=21, counter=73, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=74, counter++=73, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=74, d=1, k=1, p=1597, q=-2584, r=-987, s=1597, temp=610, v=34, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=74, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=75, counter++=74, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=75, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=76, counter++=75, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=34, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=34, b=21, c=34, counter=76, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, counter++=76, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=77] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=77] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=34, b=21, c=34, counter=77, d=1, k=0, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=34, b=21, c=13, counter=77, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=78, counter++=77, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=78, d=1, k=1, p=-2584, q=4181, r=1597, s=-2584, temp=-987, v=21, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=78, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=79, counter++=78, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=79, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=80, counter++=79, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=21, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=21, b=13, c=21, counter=80, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, counter++=80, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=81] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=81] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=21, b=13, c=21, counter=81, d=1, k=0, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=21, b=13, c=8, counter=81, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=82, counter++=81, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=82, d=1, k=1, p=4181, q=-6765, r=-2584, s=4181, temp=1597, v=13, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=82, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=83, counter++=82, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=83, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=84, counter++=83, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=13, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=13, b=8, c=13, counter=84, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, counter++=84, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=85] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=85] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=13, b=8, c=13, counter=85, d=1, k=0, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=13, b=8, c=5, counter=85, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=86, counter++=85, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=86, d=1, k=1, p=-6765, q=10946, r=4181, s=-6765, temp=-2584, v=8, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=86, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=87, counter++=86, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=87, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=88, counter++=87, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=8, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=8, b=5, c=8, counter=88, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, counter++=88, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=89] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=89] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=8, b=5, c=8, counter=89, d=1, k=0, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=8, b=5, c=3, counter=89, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=90, counter++=89, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=90, d=1, k=1, p=10946, q=-17711, r=-6765, s=10946, temp=4181, v=5, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=90, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=91, counter++=90, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=91, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=92, counter++=91, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=5, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=5, b=3, c=5, counter=92, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, counter++=92, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=93] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=93] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=5, b=3, c=5, counter=93, d=1, k=0, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=5, b=3, c=2, counter=93, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=94, counter++=93, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=94, d=1, k=1, p=-17711, q=28657, r=10946, s=-17711, temp=-6765, v=3, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=94, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=95, counter++=94, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=95, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=96, counter++=95, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=3, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=96, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, counter++=96, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L48] COND TRUE counter++<100 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=97] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=97] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=97, d=1, k=0, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=97, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=98, counter++=97, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=98, d=1, k=1, p=28657, q=-46368, r=-17711, s=28657, temp=10946, v=2, x=121393, y=196418] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=98, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=99, counter++=98, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L34] COND TRUE counter++<100 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2, b=1, c=2, counter=99, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=2, counter=100, counter++=99, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=2, x=121393, y=196418] [L41] COND TRUE counter++<100 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=2, b=1, c=2, counter=100, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L48] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=2, counter=101, counter++=100, d=1, k=0, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L48] COND FALSE !(counter++<100) [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=2, b=1, c=1, counter=101, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=102, counter++=101, d=1, k=1, p=-46368, q=75025, r=28657, s=-46368, temp=-17711, v=1, x=121393, y=196418] [L41] COND FALSE !(counter++<100) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=1, b=1, c=1, counter=102, d=1, k=1, p=75025, q=-121393, r=-46368, s=75025, temp=28657, v=1, x=121393, y=196418] [L34] EXPR counter++ VAL [\old(counter)=0, a=1, b=1, c=1, counter=103, counter++=102, d=1, k=1, p=75025, q=-121393, r=-46368, s=75025, temp=28657, v=1, x=121393, y=196418] [L34] COND FALSE !(counter++<100) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=103] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=103] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=103] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 577.7s, OverallIterations: 43, TraceHistogramMax: 97, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.6s, AutomataDifference: 384.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 25 mSolverCounterUnknown, 31101 SdHoareTripleChecker+Valid, 162.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30958 mSDsluCounter, 35285 SdHoareTripleChecker+Invalid, 157.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 292 IncrementalHoareTripleChecker+Unchecked, 30112 mSDsCounter, 23493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35234 IncrementalHoareTripleChecker+Invalid, 59044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23493 mSolverCounterUnsat, 5173 mSDtfsCounter, 35234 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13039 GetRequests, 10801 SyntacticMatches, 73 SemanticMatches, 2165 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 51370 ImplicationChecksByTransitivity, 253.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75580occurred in iteration=38, InterpolantAutomatonStates: 2031, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.9s AutomataMinimizationTime, 42 MinimizatonAttempts, 34674 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 54.3s SatisfiabilityAnalysisTime, 94.3s InterpolantComputationTime, 7390 NumberOfCodeBlocks, 6890 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 11736 ConstructedInterpolants, 0 QuantifiedInterpolants, 47828 SizeOfPredicates, 666 NumberOfNonLiveVariables, 17163 ConjunctsInSsa, 2001 ConjunctsInUnsatCore, 69 InterpolantComputations, 13 PerfectInterpolantSequences, 72513/158689 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 RESULT: Ultimate proved your program to be incorrect! [2022-03-20 05:52:48,802 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...