/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-42f9f8d-1-111_1a-sound--oss--opl3.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:41:35,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:41:35,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:41:35,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:41:35,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:41:35,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:41:35,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:41:35,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:41:35,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:41:35,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:41:35,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:41:35,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:41:35,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:41:35,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:41:35,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:41:35,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:41:35,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:41:35,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:41:35,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:41:35,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:41:35,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:41:35,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:41:35,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:41:35,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:41:35,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:41:35,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:41:35,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:41:35,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:41:35,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:41:35,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:41:35,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:41:35,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:41:35,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:41:35,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:41:35,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:41:35,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:41:35,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:41:35,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:41:35,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:41:35,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:41:35,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:41:35,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:41:35,930 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:41:35,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:41:35,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:41:35,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:41:35,936 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:41:35,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:41:35,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:41:35,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:41:35,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:41:35,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:41:35,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:41:35,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:41:35,939 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:41:35,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:41:35,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:41:35,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:41:35,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:41:35,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:41:35,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:41:35,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:41:35,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:41:35,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:41:35,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:41:35,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:41:35,941 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:41:35,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/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 [2021-01-07 01:41:36,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:41:36,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:41:36,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:41:36,363 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:41:36,364 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:41:36,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-42f9f8d-1-111_1a-sound--oss--opl3.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:36,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c38eae651/8942f2ff96764948b3f8546577e69a20/FLAG85b6c1f82 [2021-01-07 01:41:37,654 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:41:37,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-42f9f8d-1-111_1a-sound--oss--opl3.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:37,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c38eae651/8942f2ff96764948b3f8546577e69a20/FLAG85b6c1f82 [2021-01-07 01:41:38,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c38eae651/8942f2ff96764948b3f8546577e69a20 [2021-01-07 01:41:38,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:41:38,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:41:38,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:41:38,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:41:38,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:41:38,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:41:38" (1/1) ... [2021-01-07 01:41:38,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4625acc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:38, skipping insertion in model container [2021-01-07 01:41:38,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:41:38" (1/1) ... [2021-01-07 01:41:38,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:41:38,224 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[3]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[4]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[5]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[6]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[7]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[8]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[9]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[10]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[IntegerLiteral[11]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~v4op~0,],[BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~9,],IntegerLiteral[4294967296]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~0,]]],voice_mode] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~0,]]],voice_mode] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~0,]]],voice_mode] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~0,]]],voice_mode] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem70,],base],StructAccessExpression[IdentifierExpression[#t~mem70,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11344],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~devc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: VariableLHS[~stat1~0,] left hand side expression in assignment: lhs: VariableLHS[~signature~0,] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~devc~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem102,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem102,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[2],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: lhs: VariableLHS[~map~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[17],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~instr_no,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[11154],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: lhs: VariableLHS[~level~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~main_vol,] left hand side expression in assignment: lhs: VariableLHS[~volume,] left hand side expression in assignment: lhs: VariableLHS[~level~0,] left hand side expression in assignment: lhs: VariableLHS[~level~0,] left hand side expression in assignment: lhs: VariableLHS[~level~0,] left hand side expression in assignment: address: IdentifierExpression[~regbyte,] left hand side expression in assignment: lhs: VariableLHS[~map~1,] left hand side expression in assignment: lhs: VariableLHS[~instr~0,] left hand side expression in assignment: lhs: VariableLHS[~instr~0,] left hand side expression in assignment: lhs: VariableLHS[~vol1~0,] left hand side expression in assignment: lhs: VariableLHS[~vol2~0,] left hand side expression in assignment: lhs: VariableLHS[~vol1~0,] left hand side expression in assignment: lhs: VariableLHS[~vol2~0,] left hand side expression in assignment: lhs: VariableLHS[~vol3~0,] left hand side expression in assignment: lhs: VariableLHS[~vol4~0,] left hand side expression in assignment: lhs: VariableLHS[~connection~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~map~2,] left hand side expression in assignment: lhs: VariableLHS[~pan~0,] left hand side expression in assignment: lhs: VariableLHS[~instr~1,] left hand side expression in assignment: lhs: VariableLHS[~instr~1,] left hand side expression in assignment: lhs: VariableLHS[~voice_mode~0,] left hand side expression in assignment: lhs: VariableLHS[~voice_shift~0,] left hand side expression in assignment: lhs: VariableLHS[~voice_shift~0,] left hand side expression in assignment: lhs: VariableLHS[~voice_mode~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[17],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~freq~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~freq~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: lhs: VariableLHS[~f~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~f~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~f~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: address: IdentifierExpression[~fnum,] left hand side expression in assignment: address: IdentifierExpression[~block,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~3,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem281,],base],StructAccessExpression[IdentifierExpression[#t~mem281,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~3,]]],voice_mode] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11436],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem285,],base],StructAccessExpression[IdentifierExpression[#t~mem285,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem286,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[#t~mem286,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem287,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem287,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[2],IdentifierExpression[~i~4,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem288,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[#t~mem288,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~4,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11436],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem294,],base],StructAccessExpression[IdentifierExpression[#t~mem294,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11340],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ins~1,],key] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~map~3,] left hand side expression in assignment: lhs: VariableLHS[~instr~2,] left hand side expression in assignment: lhs: VariableLHS[~instr~2,] left hand side expression in assignment: lhs: VariableLHS[~connection~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~map~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~freq~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~best_time~0,] left hand side expression in assignment: lhs: VariableLHS[~instr_no~0,] left hand side expression in assignment: lhs: VariableLHS[~instr_no~0,] left hand side expression in assignment: lhs: VariableLHS[~instr~3,] left hand side expression in assignment: lhs: VariableLHS[~is4op~0,] left hand side expression in assignment: lhs: VariableLHS[~is4op~0,] left hand side expression in assignment: lhs: VariableLHS[~is4op~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~avail~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~avail~0,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~best_time~0,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~info~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~me___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11328],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11332],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11336],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11340],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11344],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11352],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11356],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11440],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11440],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11445],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~opl3_operations~0,GLOBAL],info] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~synth_devs~0,GLOBAL],[IdentifierExpression[~me___0~0,]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[ArrayAccessExpression[IdentifierExpression[~synth_devs~0,GLOBAL],[IdentifierExpression[~me___0~0,]]],base],StructAccessExpression[ArrayAccessExpression[IdentifierExpression[~synth_devs~0,GLOBAL],[IdentifierExpression[~me___0~0,]]],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[898],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[906],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem407,],base],StructAccessExpression[IdentifierExpression[#t~mem407,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11336],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11356],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~6,]]],ioaddr] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~6,]]],ioaddr] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem415,],base],StructAccessExpression[IdentifierExpression[#t~mem415,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~pv_map~0,GLOBAL],[IdentifierExpression[~i~6,]]],ioaddr] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[914],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[40],IdentifierExpression[~i~6,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~me~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~devc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg44~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg33~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] [2021-01-07 01:41:39,608 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-42f9f8d-1-111_1a-sound--oss--opl3.ko-entry_point_ldv-val-v0.8.cil.out.i[209427,209440] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] [2021-01-07 01:41:39,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:41:39,722 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~#v4op~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#v4op~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#v4op~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],BinaryExpression[ARITHMOD,IdentifierExpression[~tmp~9,],IntegerLiteral[4294967296]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem71,],base],StructAccessExpression[IdentifierExpression[#t~mem71,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11344],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~devc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]] left hand side expression in assignment: lhs: VariableLHS[~stat1~0,] left hand side expression in assignment: lhs: VariableLHS[~signature~0,] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~detected_model~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~devc~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem108,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem108,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[2],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: lhs: VariableLHS[~map~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[17],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~instr_no,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[11154],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: lhs: VariableLHS[~level~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~main_vol,] left hand side expression in assignment: lhs: VariableLHS[~volume,] left hand side expression in assignment: lhs: VariableLHS[~level~0,] left hand side expression in assignment: lhs: VariableLHS[~level~0,] left hand side expression in assignment: lhs: VariableLHS[~level~0,] left hand side expression in assignment: address: IdentifierExpression[~regbyte,] left hand side expression in assignment: lhs: VariableLHS[~map~1,] left hand side expression in assignment: lhs: VariableLHS[~instr~0,] left hand side expression in assignment: lhs: VariableLHS[~instr~0,] left hand side expression in assignment: address: IdentifierExpression[~#vol1~0,] left hand side expression in assignment: address: IdentifierExpression[~#vol2~0,] left hand side expression in assignment: address: IdentifierExpression[~#vol1~0,] left hand side expression in assignment: address: IdentifierExpression[~#vol2~0,] left hand side expression in assignment: address: IdentifierExpression[~#vol3~0,] left hand side expression in assignment: address: IdentifierExpression[~#vol4~0,] left hand side expression in assignment: lhs: VariableLHS[~connection~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~map~2,] left hand side expression in assignment: lhs: VariableLHS[~pan~0,] left hand side expression in assignment: lhs: VariableLHS[~instr~1,] left hand side expression in assignment: lhs: VariableLHS[~instr~1,] left hand side expression in assignment: lhs: VariableLHS[~voice_mode~0,] left hand side expression in assignment: lhs: VariableLHS[~voice_shift~0,] left hand side expression in assignment: lhs: VariableLHS[~voice_shift~0,] left hand side expression in assignment: lhs: VariableLHS[~voice_mode~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] left hand side expression in assignment: lhs: VariableLHS[~fpc~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[17],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~freq~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~freq~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: lhs: VariableLHS[~f~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~f~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: lhs: VariableLHS[~f~0,] left hand side expression in assignment: lhs: VariableLHS[~octave~0,] left hand side expression in assignment: address: IdentifierExpression[~fnum,] left hand side expression in assignment: address: IdentifierExpression[~block,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~3,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem306,],base],StructAccessExpression[IdentifierExpression[#t~mem306,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~3,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11436],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem310,],base],StructAccessExpression[IdentifierExpression[#t~mem310,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem311,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[#t~mem311,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem312,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[#t~mem312,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[2],IdentifierExpression[~i~4,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem313,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[#t~mem313,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~4,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11444],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11436],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem319,],base],StructAccessExpression[IdentifierExpression[#t~mem319,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11340],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ins~1,],base],StructAccessExpression[IdentifierExpression[~#ins~1,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~map~3,] left hand side expression in assignment: lhs: VariableLHS[~instr~2,] left hand side expression in assignment: lhs: VariableLHS[~instr~2,] left hand side expression in assignment: lhs: VariableLHS[~connection~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~map~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~freq~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[25],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~best_time~0,] left hand side expression in assignment: lhs: VariableLHS[~instr_no~0,] left hand side expression in assignment: lhs: VariableLHS[~instr_no~0,] left hand side expression in assignment: lhs: VariableLHS[~instr~3,] left hand side expression in assignment: lhs: VariableLHS[~is4op~0,] left hand side expression in assignment: lhs: VariableLHS[~is4op~0,] left hand side expression in assignment: lhs: VariableLHS[~is4op~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~avail~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~first~0,] left hand side expression in assignment: lhs: VariableLHS[~avail~0,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~best_time~0,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~best~0,] left hand side expression in assignment: lhs: VariableLHS[~info~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[9],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[33],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[41],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~voice,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~me___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11328],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11332],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11336],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11340],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11344],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11352],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11356],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11440],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11440],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11445],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#opl3_operations~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#opl3_operations~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#synth_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#synth_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~me___0~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem435,],base],StructAccessExpression[IdentifierExpression[#t~mem435,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[898],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[906],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem442,],base],StructAccessExpression[IdentifierExpression[#t~mem442,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11336],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11356],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~6,]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~6,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem451,],base],StructAccessExpression[IdentifierExpression[#t~mem451,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11348],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#pv_map~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~6,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[914],StructAccessExpression[IdentifierExpression[~devc~0,GLOBAL],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[40],IdentifierExpression[~i~6,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~me~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~devc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg44~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg33~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] [2021-01-07 01:41:40,048 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-42f9f8d-1-111_1a-sound--oss--opl3.ko-entry_point_ldv-val-v0.8.cil.out.i[209427,209440] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] [2021-01-07 01:41:40,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:41:40,345 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:41:40,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40 WrapperNode [2021-01-07 01:41:40,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:41:40,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:41:40,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:41:40,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:41:40,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:40,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:41,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:41:41,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:41:41,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:41:41,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:41:41,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:41,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:41,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:41,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:42,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:42,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:42,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... [2021-01-07 01:41:42,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:41:42,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:41:42,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:41:42,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:41:42,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:41:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:41:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:41:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:41:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:41:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:41:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:41:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:41:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:41:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:41:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:41:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:41:42,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:41:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:41:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:41:42,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:41:58,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:41:58,871 INFO L299 CfgBuilder]: Removed 2531 assume(true) statements. [2021-01-07 01:41:58,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:41:58 BoogieIcfgContainer [2021-01-07 01:41:58,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:41:58,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:41:58,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:41:58,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:41:58,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:41:38" (1/3) ... [2021-01-07 01:41:58,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35536545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:41:58, skipping insertion in model container [2021-01-07 01:41:58,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:40" (2/3) ... [2021-01-07 01:41:58,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35536545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:41:58, skipping insertion in model container [2021-01-07 01:41:58,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:41:58" (3/3) ... [2021-01-07 01:41:58,896 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-42f9f8d-1-111_1a-sound--oss--opl3.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:58,902 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:41:58,909 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2021-01-07 01:41:58,930 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-01-07 01:41:58,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:41:58,975 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:41:58,975 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:41:58,975 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:41:58,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:41:58,976 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:41:58,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:41:58,976 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:41:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states. [2021-01-07 01:41:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-07 01:41:59,064 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:59,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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] [2021-01-07 01:41:59,066 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1906996444, now seen corresponding path program 1 times [2021-01-07 01:41:59,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:59,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989179836] [2021-01-07 01:41:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:00,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989179836] [2021-01-07 01:42:00,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:00,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:00,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002117768] [2021-01-07 01:42:00,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:42:00,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:00,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:42:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:42:00,425 INFO L87 Difference]: Start difference. First operand 3245 states. Second operand 2 states. [2021-01-07 01:42:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:00,662 INFO L93 Difference]: Finished difference Result 6486 states and 9595 transitions. [2021-01-07 01:42:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:42:00,664 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 148 [2021-01-07 01:42:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:00,701 INFO L225 Difference]: With dead ends: 6486 [2021-01-07 01:42:00,702 INFO L226 Difference]: Without dead ends: 3230 [2021-01-07 01:42:00,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:42:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2021-01-07 01:42:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2021-01-07 01:42:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2021-01-07 01:42:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 4559 transitions. [2021-01-07 01:42:00,941 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 4559 transitions. Word has length 148 [2021-01-07 01:42:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:00,942 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 4559 transitions. [2021-01-07 01:42:00,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:42:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 4559 transitions. [2021-01-07 01:42:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-07 01:42:00,953 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:00,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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] [2021-01-07 01:42:00,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:42:00,954 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 267116844, now seen corresponding path program 1 times [2021-01-07 01:42:00,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:00,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905171530] [2021-01-07 01:42:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:01,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905171530] [2021-01-07 01:42:01,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:01,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:01,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086379467] [2021-01-07 01:42:01,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:01,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:01,719 INFO L87 Difference]: Start difference. First operand 3230 states and 4559 transitions. Second operand 3 states. [2021-01-07 01:42:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:02,279 INFO L93 Difference]: Finished difference Result 6540 states and 9237 transitions. [2021-01-07 01:42:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:02,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2021-01-07 01:42:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:02,303 INFO L225 Difference]: With dead ends: 6540 [2021-01-07 01:42:02,303 INFO L226 Difference]: Without dead ends: 3446 [2021-01-07 01:42:02,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2021-01-07 01:42:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3446. [2021-01-07 01:42:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2021-01-07 01:42:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4852 transitions. [2021-01-07 01:42:02,435 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4852 transitions. Word has length 148 [2021-01-07 01:42:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:02,438 INFO L481 AbstractCegarLoop]: Abstraction has 3446 states and 4852 transitions. [2021-01-07 01:42:02,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4852 transitions. [2021-01-07 01:42:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-07 01:42:02,445 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:02,445 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:02,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:42:02,446 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 55713828, now seen corresponding path program 1 times [2021-01-07 01:42:02,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:02,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107654561] [2021-01-07 01:42:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:03,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107654561] [2021-01-07 01:42:03,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:03,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:03,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9313502] [2021-01-07 01:42:03,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:03,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:03,369 INFO L87 Difference]: Start difference. First operand 3446 states and 4852 transitions. Second operand 3 states. [2021-01-07 01:42:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:03,547 INFO L93 Difference]: Finished difference Result 6756 states and 9529 transitions. [2021-01-07 01:42:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-07 01:42:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:03,580 INFO L225 Difference]: With dead ends: 6756 [2021-01-07 01:42:03,581 INFO L226 Difference]: Without dead ends: 3446 [2021-01-07 01:42:03,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2021-01-07 01:42:03,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3446. [2021-01-07 01:42:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2021-01-07 01:42:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4850 transitions. [2021-01-07 01:42:03,721 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4850 transitions. Word has length 160 [2021-01-07 01:42:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:03,722 INFO L481 AbstractCegarLoop]: Abstraction has 3446 states and 4850 transitions. [2021-01-07 01:42:03,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4850 transitions. [2021-01-07 01:42:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-01-07 01:42:03,725 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:03,726 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:03,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:42:03,727 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1976720960, now seen corresponding path program 1 times [2021-01-07 01:42:03,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:03,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977770849] [2021-01-07 01:42:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:04,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977770849] [2021-01-07 01:42:04,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:04,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:04,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992256614] [2021-01-07 01:42:04,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:04,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:04,337 INFO L87 Difference]: Start difference. First operand 3446 states and 4850 transitions. Second operand 4 states. [2021-01-07 01:42:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:04,949 INFO L93 Difference]: Finished difference Result 6762 states and 9533 transitions. [2021-01-07 01:42:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:42:04,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2021-01-07 01:42:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:04,970 INFO L225 Difference]: With dead ends: 6762 [2021-01-07 01:42:04,970 INFO L226 Difference]: Without dead ends: 3446 [2021-01-07 01:42:04,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2021-01-07 01:42:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3446. [2021-01-07 01:42:05,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3446 states. [2021-01-07 01:42:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4848 transitions. [2021-01-07 01:42:05,109 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4848 transitions. Word has length 162 [2021-01-07 01:42:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:05,109 INFO L481 AbstractCegarLoop]: Abstraction has 3446 states and 4848 transitions. [2021-01-07 01:42:05,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4848 transitions. [2021-01-07 01:42:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-01-07 01:42:05,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:05,112 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:05,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:42:05,113 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 944906271, now seen corresponding path program 1 times [2021-01-07 01:42:05,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:05,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985044918] [2021-01-07 01:42:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:05,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985044918] [2021-01-07 01:42:05,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:05,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:05,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191021134] [2021-01-07 01:42:05,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:05,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:05,815 INFO L87 Difference]: Start difference. First operand 3446 states and 4848 transitions. Second operand 4 states. [2021-01-07 01:42:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:06,016 INFO L93 Difference]: Finished difference Result 6760 states and 9525 transitions. [2021-01-07 01:42:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:42:06,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2021-01-07 01:42:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:06,036 INFO L225 Difference]: With dead ends: 6760 [2021-01-07 01:42:06,036 INFO L226 Difference]: Without dead ends: 3440 [2021-01-07 01:42:06,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2021-01-07 01:42:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3440. [2021-01-07 01:42:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2021-01-07 01:42:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4834 transitions. [2021-01-07 01:42:06,171 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4834 transitions. Word has length 165 [2021-01-07 01:42:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:06,172 INFO L481 AbstractCegarLoop]: Abstraction has 3440 states and 4834 transitions. [2021-01-07 01:42:06,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4834 transitions. [2021-01-07 01:42:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-01-07 01:42:06,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:06,176 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:06,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:42:06,177 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:06,177 INFO L82 PathProgramCache]: Analyzing trace with hash -693292349, now seen corresponding path program 1 times [2021-01-07 01:42:06,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:06,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986974103] [2021-01-07 01:42:06,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:06,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986974103] [2021-01-07 01:42:06,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:06,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:06,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200203176] [2021-01-07 01:42:06,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:06,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:06,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:06,859 INFO L87 Difference]: Start difference. First operand 3440 states and 4834 transitions. Second operand 3 states. [2021-01-07 01:42:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:07,035 INFO L93 Difference]: Finished difference Result 6772 states and 9531 transitions. [2021-01-07 01:42:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:07,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2021-01-07 01:42:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:07,056 INFO L225 Difference]: With dead ends: 6772 [2021-01-07 01:42:07,056 INFO L226 Difference]: Without dead ends: 3468 [2021-01-07 01:42:07,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-01-07 01:42:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3442. [2021-01-07 01:42:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2021-01-07 01:42:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 4836 transitions. [2021-01-07 01:42:07,194 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 4836 transitions. Word has length 207 [2021-01-07 01:42:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:07,194 INFO L481 AbstractCegarLoop]: Abstraction has 3442 states and 4836 transitions. [2021-01-07 01:42:07,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 4836 transitions. [2021-01-07 01:42:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-07 01:42:07,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:07,198 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 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] [2021-01-07 01:42:07,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:42:07,199 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:07,199 INFO L82 PathProgramCache]: Analyzing trace with hash 465854235, now seen corresponding path program 1 times [2021-01-07 01:42:07,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:07,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140864709] [2021-01-07 01:42:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:07,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140864709] [2021-01-07 01:42:07,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066798193] [2021-01-07 01:42:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:10,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 7757 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:42:10,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:10,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:42:10,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 01:42:10,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809469173] [2021-01-07 01:42:10,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:10,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:10,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:10,489 INFO L87 Difference]: Start difference. First operand 3442 states and 4836 transitions. Second operand 5 states. [2021-01-07 01:42:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:10,718 INFO L93 Difference]: Finished difference Result 6802 states and 9569 transitions. [2021-01-07 01:42:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:42:10,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2021-01-07 01:42:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:10,740 INFO L225 Difference]: With dead ends: 6802 [2021-01-07 01:42:10,740 INFO L226 Difference]: Without dead ends: 3496 [2021-01-07 01:42:10,748 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2021-01-07 01:42:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3470. [2021-01-07 01:42:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3470 states. [2021-01-07 01:42:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3470 states to 3470 states and 4872 transitions. [2021-01-07 01:42:11,045 INFO L78 Accepts]: Start accepts. Automaton has 3470 states and 4872 transitions. Word has length 215 [2021-01-07 01:42:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:11,046 INFO L481 AbstractCegarLoop]: Abstraction has 3470 states and 4872 transitions. [2021-01-07 01:42:11,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4872 transitions. [2021-01-07 01:42:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-01-07 01:42:11,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:11,050 INFO L422 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:11,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-07 01:42:11,266 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 343257971, now seen corresponding path program 2 times [2021-01-07 01:42:11,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:11,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819754969] [2021-01-07 01:42:11,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 01:42:12,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819754969] [2021-01-07 01:42:12,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:12,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:12,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289183852] [2021-01-07 01:42:12,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:12,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:12,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:12,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:12,109 INFO L87 Difference]: Start difference. First operand 3470 states and 4872 transitions. Second operand 3 states. [2021-01-07 01:42:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:15,541 INFO L93 Difference]: Finished difference Result 6607 states and 9309 transitions. [2021-01-07 01:42:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:15,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2021-01-07 01:42:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:15,580 INFO L225 Difference]: With dead ends: 6607 [2021-01-07 01:42:15,581 INFO L226 Difference]: Without dead ends: 3255 [2021-01-07 01:42:15,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-01-07 01:42:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2021-01-07 01:42:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-07 01:42:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4584 transitions. [2021-01-07 01:42:15,811 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4584 transitions. Word has length 223 [2021-01-07 01:42:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:15,812 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4584 transitions. [2021-01-07 01:42:15,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4584 transitions. [2021-01-07 01:42:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-07 01:42:15,817 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:15,817 INFO L422 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, 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, 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, 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, 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, 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, 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] [2021-01-07 01:42:15,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:42:15,818 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1424246894, now seen corresponding path program 1 times [2021-01-07 01:42:15,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:15,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871473120] [2021-01-07 01:42:15,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:16,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871473120] [2021-01-07 01:42:16,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087975754] [2021-01-07 01:42:16,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:18,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 7809 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:42:18,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:18,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:42:18,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 01:42:18,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887298256] [2021-01-07 01:42:18,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:42:18,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:42:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:42:18,989 INFO L87 Difference]: Start difference. First operand 3255 states and 4584 transitions. Second operand 6 states. [2021-01-07 01:42:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:19,272 INFO L93 Difference]: Finished difference Result 6258 states and 8842 transitions. [2021-01-07 01:42:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:19,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2021-01-07 01:42:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:19,284 INFO L225 Difference]: With dead ends: 6258 [2021-01-07 01:42:19,284 INFO L226 Difference]: Without dead ends: 3282 [2021-01-07 01:42:19,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:42:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2021-01-07 01:42:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3269. [2021-01-07 01:42:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2021-01-07 01:42:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4602 transitions. [2021-01-07 01:42:19,477 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4602 transitions. Word has length 225 [2021-01-07 01:42:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:19,477 INFO L481 AbstractCegarLoop]: Abstraction has 3269 states and 4602 transitions. [2021-01-07 01:42:19,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:42:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4602 transitions. [2021-01-07 01:42:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-01-07 01:42:19,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:19,482 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:19,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:19,696 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash 496635590, now seen corresponding path program 2 times [2021-01-07 01:42:19,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:19,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385860578] [2021-01-07 01:42:19,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:20,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385860578] [2021-01-07 01:42:20,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362615992] [2021-01-07 01:42:20,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:27,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:42:27,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:42:27,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 7325 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-07 01:42:27,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-01-07 01:42:27,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:42:27,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-01-07 01:42:27,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215545967] [2021-01-07 01:42:27,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:27,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:27,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:27,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:27,829 INFO L87 Difference]: Start difference. First operand 3269 states and 4602 transitions. Second operand 3 states. [2021-01-07 01:42:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:28,312 INFO L93 Difference]: Finished difference Result 6036 states and 8554 transitions. [2021-01-07 01:42:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:28,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2021-01-07 01:42:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:28,328 INFO L225 Difference]: With dead ends: 6036 [2021-01-07 01:42:28,329 INFO L226 Difference]: Without dead ends: 6032 [2021-01-07 01:42:28,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2021-01-07 01:42:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3265. [2021-01-07 01:42:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2021-01-07 01:42:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 4598 transitions. [2021-01-07 01:42:28,549 INFO L78 Accepts]: Start accepts. Automaton has 3265 states and 4598 transitions. Word has length 233 [2021-01-07 01:42:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:28,549 INFO L481 AbstractCegarLoop]: Abstraction has 3265 states and 4598 transitions. [2021-01-07 01:42:28,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 4598 transitions. [2021-01-07 01:42:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-01-07 01:42:28,554 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:28,554 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:28,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 01:42:28,770 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash 511421900, now seen corresponding path program 1 times [2021-01-07 01:42:28,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:28,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565342126] [2021-01-07 01:42:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:29,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565342126] [2021-01-07 01:42:29,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816580553] [2021-01-07 01:42:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:31,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 7886 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 01:42:31,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:31,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:42:31,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-07 01:42:31,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064094939] [2021-01-07 01:42:31,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:42:31,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:42:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:31,761 INFO L87 Difference]: Start difference. First operand 3265 states and 4598 transitions. Second operand 7 states. [2021-01-07 01:42:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:32,072 INFO L93 Difference]: Finished difference Result 6264 states and 8852 transitions. [2021-01-07 01:42:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:42:32,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2021-01-07 01:42:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:32,083 INFO L225 Difference]: With dead ends: 6264 [2021-01-07 01:42:32,084 INFO L226 Difference]: Without dead ends: 3292 [2021-01-07 01:42:32,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2021-01-07 01:42:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3279. [2021-01-07 01:42:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3279 states. [2021-01-07 01:42:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4616 transitions. [2021-01-07 01:42:32,284 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4616 transitions. Word has length 237 [2021-01-07 01:42:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:32,284 INFO L481 AbstractCegarLoop]: Abstraction has 3279 states and 4616 transitions. [2021-01-07 01:42:32,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 01:42:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4616 transitions. [2021-01-07 01:42:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2021-01-07 01:42:32,289 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:32,289 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1] [2021-01-07 01:42:32,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:32,503 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash -742215644, now seen corresponding path program 2 times [2021-01-07 01:42:32,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:32,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42800996] [2021-01-07 01:42:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:33,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42800996] [2021-01-07 01:42:33,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073786808] [2021-01-07 01:42:33,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:35,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:42:35,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:42:35,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 7357 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:42:35,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-01-07 01:42:35,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:42:35,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-01-07 01:42:35,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889416212] [2021-01-07 01:42:35,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:35,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:35,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:35,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:42:35,422 INFO L87 Difference]: Start difference. First operand 3279 states and 4616 transitions. Second operand 3 states. [2021-01-07 01:42:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:35,847 INFO L93 Difference]: Finished difference Result 6006 states and 8506 transitions. [2021-01-07 01:42:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:35,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2021-01-07 01:42:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:35,866 INFO L225 Difference]: With dead ends: 6006 [2021-01-07 01:42:35,866 INFO L226 Difference]: Without dead ends: 5994 [2021-01-07 01:42:35,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:42:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2021-01-07 01:42:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3267. [2021-01-07 01:42:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2021-01-07 01:42:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 4604 transitions. [2021-01-07 01:42:36,108 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 4604 transitions. Word has length 245 [2021-01-07 01:42:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:36,108 INFO L481 AbstractCegarLoop]: Abstraction has 3267 states and 4604 transitions. [2021-01-07 01:42:36,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4604 transitions. [2021-01-07 01:42:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-01-07 01:42:36,114 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:36,115 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:36,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 01:42:36,330 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1452013442, now seen corresponding path program 1 times [2021-01-07 01:42:36,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:36,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119143988] [2021-01-07 01:42:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:37,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119143988] [2021-01-07 01:42:37,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303672112] [2021-01-07 01:42:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:39,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 7924 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 01:42:39,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:39,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:42:39,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-01-07 01:42:39,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600428566] [2021-01-07 01:42:39,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:42:39,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:39,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:42:39,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:42:39,822 INFO L87 Difference]: Start difference. First operand 3267 states and 4604 transitions. Second operand 8 states. [2021-01-07 01:42:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:40,229 INFO L93 Difference]: Finished difference Result 6254 states and 8846 transitions. [2021-01-07 01:42:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:42:40,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2021-01-07 01:42:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:40,239 INFO L225 Difference]: With dead ends: 6254 [2021-01-07 01:42:40,239 INFO L226 Difference]: Without dead ends: 3294 [2021-01-07 01:42:40,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:42:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2021-01-07 01:42:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3281. [2021-01-07 01:42:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2021-01-07 01:42:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 4622 transitions. [2021-01-07 01:42:40,462 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 4622 transitions. Word has length 250 [2021-01-07 01:42:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:40,463 INFO L481 AbstractCegarLoop]: Abstraction has 3281 states and 4622 transitions. [2021-01-07 01:42:40,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:42:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 4622 transitions. [2021-01-07 01:42:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2021-01-07 01:42:40,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:40,469 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 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, 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] [2021-01-07 01:42:40,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:40,684 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 209028138, now seen corresponding path program 2 times [2021-01-07 01:42:40,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:40,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445751003] [2021-01-07 01:42:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:42:41,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445751003] [2021-01-07 01:42:41,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4172112] [2021-01-07 01:42:41,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:48,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:42:48,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:42:48,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 7350 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 01:42:48,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-01-07 01:42:48,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:42:48,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-01-07 01:42:48,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115411300] [2021-01-07 01:42:48,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:48,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:42:48,370 INFO L87 Difference]: Start difference. First operand 3281 states and 4622 transitions. Second operand 3 states. [2021-01-07 01:42:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:49,016 INFO L93 Difference]: Finished difference Result 6581 states and 9301 transitions. [2021-01-07 01:42:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:49,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2021-01-07 01:42:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:49,027 INFO L225 Difference]: With dead ends: 6581 [2021-01-07 01:42:49,027 INFO L226 Difference]: Without dead ends: 3320 [2021-01-07 01:42:49,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:42:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2021-01-07 01:42:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3320. [2021-01-07 01:42:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3320 states. [2021-01-07 01:42:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4661 transitions. [2021-01-07 01:42:49,236 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4661 transitions. Word has length 258 [2021-01-07 01:42:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:49,236 INFO L481 AbstractCegarLoop]: Abstraction has 3320 states and 4661 transitions. [2021-01-07 01:42:49,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4661 transitions. [2021-01-07 01:42:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-01-07 01:42:49,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:49,243 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:49,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 01:42:49,444 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -257401454, now seen corresponding path program 1 times [2021-01-07 01:42:49,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:49,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291480508] [2021-01-07 01:42:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:42:50,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291480508] [2021-01-07 01:42:50,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115022901] [2021-01-07 01:42:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:52,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 8203 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 01:42:52,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 85 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:42:53,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:42:53,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2021-01-07 01:42:53,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368234085] [2021-01-07 01:42:53,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 01:42:53,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:53,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 01:42:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:42:53,090 INFO L87 Difference]: Start difference. First operand 3320 states and 4661 transitions. Second operand 9 states. [2021-01-07 01:42:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:53,416 INFO L93 Difference]: Finished difference Result 6307 states and 8903 transitions. [2021-01-07 01:42:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:42:53,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2021-01-07 01:42:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:53,426 INFO L225 Difference]: With dead ends: 6307 [2021-01-07 01:42:53,426 INFO L226 Difference]: Without dead ends: 3347 [2021-01-07 01:42:53,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:42:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2021-01-07 01:42:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3334. [2021-01-07 01:42:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2021-01-07 01:42:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4679 transitions. [2021-01-07 01:42:53,713 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4679 transitions. Word has length 297 [2021-01-07 01:42:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:53,713 INFO L481 AbstractCegarLoop]: Abstraction has 3334 states and 4679 transitions. [2021-01-07 01:42:53,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 01:42:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4679 transitions. [2021-01-07 01:42:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2021-01-07 01:42:53,720 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:53,721 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:53,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 01:42:53,937 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1393744442, now seen corresponding path program 2 times [2021-01-07 01:42:53,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:53,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496340700] [2021-01-07 01:42:53,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 126 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:42:54,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496340700] [2021-01-07 01:42:54,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047900723] [2021-01-07 01:42:54,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:06,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:43:06,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:43:06,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 8248 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 01:43:06,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 126 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:43:06,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:06,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-01-07 01:43:06,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194088558] [2021-01-07 01:43:06,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 01:43:06,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:06,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 01:43:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:43:06,684 INFO L87 Difference]: Start difference. First operand 3334 states and 4679 transitions. Second operand 10 states. [2021-01-07 01:43:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:06,982 INFO L93 Difference]: Finished difference Result 6321 states and 8921 transitions. [2021-01-07 01:43:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:43:06,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2021-01-07 01:43:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:06,993 INFO L225 Difference]: With dead ends: 6321 [2021-01-07 01:43:06,993 INFO L226 Difference]: Without dead ends: 3361 [2021-01-07 01:43:07,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:43:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2021-01-07 01:43:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3348. [2021-01-07 01:43:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3348 states. [2021-01-07 01:43:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4697 transitions. [2021-01-07 01:43:07,245 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4697 transitions. Word has length 305 [2021-01-07 01:43:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:07,246 INFO L481 AbstractCegarLoop]: Abstraction has 3348 states and 4697 transitions. [2021-01-07 01:43:07,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 01:43:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4697 transitions. [2021-01-07 01:43:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2021-01-07 01:43:07,253 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:07,253 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:07,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 01:43:07,454 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:07,456 INFO L82 PathProgramCache]: Analyzing trace with hash 506080994, now seen corresponding path program 3 times [2021-01-07 01:43:07,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:07,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309386061] [2021-01-07 01:43:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 175 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:43:08,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309386061] [2021-01-07 01:43:08,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478941050] [2021-01-07 01:43:08,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:21,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 01:43:21,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:43:21,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 7978 conjuncts, 42 conjunts are in the unsatisfiable core [2021-01-07 01:43:21,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2021-01-07 01:43:22,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:43:22,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-01-07 01:43:22,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168764648] [2021-01-07 01:43:22,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:43:22,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:43:22,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-01-07 01:43:22,310 INFO L87 Difference]: Start difference. First operand 3348 states and 4697 transitions. Second operand 8 states. [2021-01-07 01:43:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:25,272 INFO L93 Difference]: Finished difference Result 9644 states and 13596 transitions. [2021-01-07 01:43:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:43:25,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 313 [2021-01-07 01:43:25,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:25,392 INFO L225 Difference]: With dead ends: 9644 [2021-01-07 01:43:25,392 INFO L226 Difference]: Without dead ends: 6489 [2021-01-07 01:43:25,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2021-01-07 01:43:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6489 states. [2021-01-07 01:43:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6489 to 3348. [2021-01-07 01:43:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3348 states. [2021-01-07 01:43:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 4696 transitions. [2021-01-07 01:43:25,648 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 4696 transitions. Word has length 313 [2021-01-07 01:43:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:25,649 INFO L481 AbstractCegarLoop]: Abstraction has 3348 states and 4696 transitions. [2021-01-07 01:43:25,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:43:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 4696 transitions. [2021-01-07 01:43:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2021-01-07 01:43:25,655 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:25,655 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:25,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 01:43:25,856 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:25,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1424339642, now seen corresponding path program 1 times [2021-01-07 01:43:25,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:25,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843647671] [2021-01-07 01:43:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 175 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:43:26,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843647671] [2021-01-07 01:43:26,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469784909] [2021-01-07 01:43:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:29,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 8315 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 01:43:29,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 2 proven. 175 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:43:29,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:29,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-01-07 01:43:29,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917927812] [2021-01-07 01:43:29,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 01:43:29,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:29,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 01:43:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-07 01:43:29,531 INFO L87 Difference]: Start difference. First operand 3348 states and 4696 transitions. Second operand 11 states. [2021-01-07 01:43:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:29,852 INFO L93 Difference]: Finished difference Result 6335 states and 8938 transitions. [2021-01-07 01:43:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 01:43:29,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 315 [2021-01-07 01:43:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:29,864 INFO L225 Difference]: With dead ends: 6335 [2021-01-07 01:43:29,864 INFO L226 Difference]: Without dead ends: 3375 [2021-01-07 01:43:29,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-07 01:43:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2021-01-07 01:43:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3362. [2021-01-07 01:43:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3362 states. [2021-01-07 01:43:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 4714 transitions. [2021-01-07 01:43:30,105 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 4714 transitions. Word has length 315 [2021-01-07 01:43:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:30,106 INFO L481 AbstractCegarLoop]: Abstraction has 3362 states and 4714 transitions. [2021-01-07 01:43:30,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 01:43:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 4714 transitions. [2021-01-07 01:43:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2021-01-07 01:43:30,110 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:30,110 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:30,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 01:43:30,324 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:30,325 INFO L82 PathProgramCache]: Analyzing trace with hash 809752046, now seen corresponding path program 2 times [2021-01-07 01:43:30,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:30,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945239744] [2021-01-07 01:43:30,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 2 proven. 232 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:43:31,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945239744] [2021-01-07 01:43:31,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281815880] [2021-01-07 01:43:31,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:46,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:43:46,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:43:46,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 8360 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-07 01:43:46,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 2 proven. 232 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:43:46,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:46,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-01-07 01:43:46,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462433889] [2021-01-07 01:43:46,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 01:43:46,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 01:43:46,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-01-07 01:43:46,982 INFO L87 Difference]: Start difference. First operand 3362 states and 4714 transitions. Second operand 12 states. [2021-01-07 01:43:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:47,297 INFO L93 Difference]: Finished difference Result 6336 states and 8939 transitions. [2021-01-07 01:43:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 01:43:47,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 323 [2021-01-07 01:43:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:47,305 INFO L225 Difference]: With dead ends: 6336 [2021-01-07 01:43:47,305 INFO L226 Difference]: Without dead ends: 3376 [2021-01-07 01:43:47,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-01-07 01:43:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2021-01-07 01:43:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3376. [2021-01-07 01:43:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2021-01-07 01:43:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4732 transitions. [2021-01-07 01:43:47,536 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4732 transitions. Word has length 323 [2021-01-07 01:43:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:47,537 INFO L481 AbstractCegarLoop]: Abstraction has 3376 states and 4732 transitions. [2021-01-07 01:43:47,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 01:43:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4732 transitions. [2021-01-07 01:43:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2021-01-07 01:43:47,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:47,541 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:47,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:47,755 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 609105558, now seen corresponding path program 3 times [2021-01-07 01:43:47,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:47,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359595591] [2021-01-07 01:43:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2021-01-07 01:43:48,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359595591] [2021-01-07 01:43:48,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:48,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:43:48,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992541301] [2021-01-07 01:43:48,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:43:48,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:43:48,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:48,649 INFO L87 Difference]: Start difference. First operand 3376 states and 4732 transitions. Second operand 5 states. [2021-01-07 01:43:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:49,362 INFO L93 Difference]: Finished difference Result 9659 states and 13613 transitions. [2021-01-07 01:43:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:43:49,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 331 [2021-01-07 01:43:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:49,373 INFO L225 Difference]: With dead ends: 9659 [2021-01-07 01:43:49,373 INFO L226 Difference]: Without dead ends: 6487 [2021-01-07 01:43:49,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:43:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6487 states. [2021-01-07 01:43:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6487 to 3376. [2021-01-07 01:43:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3376 states. [2021-01-07 01:43:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4731 transitions. [2021-01-07 01:43:49,663 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4731 transitions. Word has length 331 [2021-01-07 01:43:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:49,663 INFO L481 AbstractCegarLoop]: Abstraction has 3376 states and 4731 transitions. [2021-01-07 01:43:49,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:43:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4731 transitions. [2021-01-07 01:43:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2021-01-07 01:43:49,667 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:49,668 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:49,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 01:43:49,668 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1944663026, now seen corresponding path program 1 times [2021-01-07 01:43:49,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:49,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865346619] [2021-01-07 01:43:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-01-07 01:43:51,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865346619] [2021-01-07 01:43:51,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122455854] [2021-01-07 01:43:51,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:44:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:03,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 8427 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 01:44:03,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:44:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-01-07 01:44:04,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:44:04,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:44:04,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145438349] [2021-01-07 01:44:04,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:44:04,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:44:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:44:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:44:04,156 INFO L87 Difference]: Start difference. First operand 3376 states and 4731 transitions. Second operand 6 states. [2021-01-07 01:44:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:44:05,117 INFO L93 Difference]: Finished difference Result 6770 states and 9518 transitions. [2021-01-07 01:44:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:44:05,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2021-01-07 01:44:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:44:05,121 INFO L225 Difference]: With dead ends: 6770 [2021-01-07 01:44:05,122 INFO L226 Difference]: Without dead ends: 3415 [2021-01-07 01:44:05,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:44:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2021-01-07 01:44:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3415. [2021-01-07 01:44:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2021-01-07 01:44:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4770 transitions. [2021-01-07 01:44:05,384 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4770 transitions. Word has length 333 [2021-01-07 01:44:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:44:05,385 INFO L481 AbstractCegarLoop]: Abstraction has 3415 states and 4770 transitions. [2021-01-07 01:44:05,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:44:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4770 transitions. [2021-01-07 01:44:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-01-07 01:44:05,390 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:44:05,390 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:44:05,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-07 01:44:05,604 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:44:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:44:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash 759891850, now seen corresponding path program 2 times [2021-01-07 01:44:05,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:44:05,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247213730] [2021-01-07 01:44:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:44:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:44:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2021-01-07 01:44:07,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247213730] [2021-01-07 01:44:07,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746942445] [2021-01-07 01:44:07,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:45:01,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:45:01,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:45:01,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 8661 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 01:45:01,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:45:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2021-01-07 01:45:02,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:45:02,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 01:45:02,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180046528] [2021-01-07 01:45:02,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:45:02,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:45:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:45:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:45:02,099 INFO L87 Difference]: Start difference. First operand 3415 states and 4770 transitions. Second operand 8 states. [2021-01-07 01:45:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:45:03,181 INFO L93 Difference]: Finished difference Result 6847 states and 9595 transitions. [2021-01-07 01:45:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:45:03,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 372 [2021-01-07 01:45:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:45:03,188 INFO L225 Difference]: With dead ends: 6847 [2021-01-07 01:45:03,188 INFO L226 Difference]: Without dead ends: 3454 [2021-01-07 01:45:03,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:45:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2021-01-07 01:45:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3454. [2021-01-07 01:45:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2021-01-07 01:45:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4809 transitions. [2021-01-07 01:45:03,522 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4809 transitions. Word has length 372 [2021-01-07 01:45:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:45:03,522 INFO L481 AbstractCegarLoop]: Abstraction has 3454 states and 4809 transitions. [2021-01-07 01:45:03,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:45:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4809 transitions. [2021-01-07 01:45:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2021-01-07 01:45:03,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:45:03,527 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1] [2021-01-07 01:45:03,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:45:03,741 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:45:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:45:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1143539470, now seen corresponding path program 3 times [2021-01-07 01:45:03,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:45:03,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538498486] [2021-01-07 01:45:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:45:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:45:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2021-01-07 01:45:07,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538498486] [2021-01-07 01:45:07,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250116927] [2021-01-07 01:45:07,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true